问题描述
解题思路:
数据范围<1000, 所以n²枚举就可以解决问题
代码实现
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1010;
int s[N];
int n;
int main()
{
cin >> n;
for (int i = 0; i < n; i ++) cin >> s[i];
int res = 1e6;
for (int i = 0; i < n - 1; i ++)
{
for (int j = i + 1; j < n; j ++)
{
res = min(res, abs(s[j] - s[i]));
}
}
cout << res;
return 0;
}