#include <iostream> #include <vector> #include <cmath> #include <climits> #include <algorithm> using namespace std; int main() { int n; cin >> n; vector<long long> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; } long long minDist = INT_MAX; int k = 4; // 比较的范围窗口 for (int i = 0; i < n; i++) { for (int j = i + 1; j <= min(n - 1, i + k); j++) { long long dist = abs(arr[i] - arr[j]); if (dist < minDist) { minDist = dist; } } } cout << minDist << endl; return 0; }