Download code/train/C++/0002138_A.cpp from Variable-role/sajaniemi_variable_dataset_large: direct link, hf CLI and curl.
- Browser
- Download file 792 Bytes
-
https://huggingface.co/datasets/Variable-role/sajaniemi_variable_dataset_large/resolve/main/code/train/C%2B%2B/0002138_A.cpp
- Command line
-
hf download hf://datasets/Variable-role/sajaniemi_variable_dataset_large/code/train/C++/0002138_A.cpp
-
curl -L -o 0002138_A.cpp https://huggingface.co/datasets/Variable-role/sajaniemi_variable_dataset_large/resolve/main/code/train/C%2B%2B/0002138_A.cpp
792 Bytes
| // This is a personal academic project. Dear PVS-Studio, please check it. | |
| // PVS-Studio Static Code Analyzer for C, C++ and C#: http://www.viva64.com | |
| // PVS-settings | |
| // PVS-settings end | |
| using namespace std; | |
| int main() | |
| { | |
| int n, a, m; | |
| cin >> n; | |
| vector<pair<int, int> > arr(n); | |
| for (int i = 0; i < n; ++i) | |
| { | |
| cin >> a; | |
| arr[i] = make_pair(a, i + 1); | |
| } | |
| sort(arr.begin(), arr.end()); | |
| m = 2000000005; | |
| for (int i = 1; i < n; ++i) | |
| if (arr[i].first - arr[i - 1].first < m) | |
| { | |
| a = i; | |
| m = arr[i].first - arr[i - 1].first; | |
| } | |
| cout << m << endl << | |
| ((arr[a - 1].second > arr[a].second) ? arr[a].second : arr[a - 1].second) << ' ' << | |
| ((arr[a - 1].second > arr[a].second) ? arr[a - 1].second : arr[a].second); | |
| return 0; | |
| } | |