| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 71821 | 沈俊博 | 两个数的最小距离II | C++ | Accepted | 2 MS | 284 KB | 709 | 2024-04-27 17:14:58 |
# include<iostream> # include<cmath> using namespace std; long long a[1001]; int n; int main(){ cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } long long t=0,min = abs (a[1] - a[2]); for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { t = abs(a[i] - a[j]); if (t < min) { min = t; } } } for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { t = abs(a[i] - a[j]); if (t == min) { cout<<i<<" "<<j; return 0; } } } return 0; }