Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
124934 | 曹老师 | 两个数的最小距离 | C++ | Wrong Answer | 1 MS | 272 KB | 522 | 2025-07-12 17:10:22 |
// // Created by CCG on 25-7-11. // #include<bits/stdc++.h> using namespace std; int main() { long long a[1001] = {},min=999999999999999999; long long n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } // min = a[2] - a[1]; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { int s = abs(a[i] - a[j]); if (s < min) { min = s; } } } cout << min; return 0; }
------Input------
79 -1665227684 -895844781 1221608499 -964305153 -895198681 522723254 444672734 1808916495 1994680172 -1179319139 -289974733 -924296047 836454324 -1783984429 1108527955 -739605933 -289298993 -1923720840 667858976 476244695 -1676089289 191438504 1862984370 -653248244 -1342345625 115820572 -1004254242 2146887921 1279171213 1525784403 -53241408 1730714858 1155166948 -1594268325 -446647624 497434833 -975220477 1418805968 -1987562118 2095217452 744295972 625427042 -302518341 1075169041 -207278422 1105
------Answer-----
322746
------Your output-----
-2147045069