#include <iostream>
#include <algorithm>
using namespace std;
const int N = 500005;
int n, T, a[N];
signed main(void) {
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> n >> T;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] %= T;
}
sort(a + 1, a + n + 1);
int ans = (a[n] - a[1] + 1) >> 1;
for (int i = n - 1; i; i--) {
ans = min(ans, (a[i] - a[i + 1] + T + 1) >> 1);
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |