#include <iostream>
#include <vector>
#include <queue>
#include <map>
using namespace std;
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
int mn = 2e9, val, n, T;
cin >> n >> T;
vector<int> a(n);
for(int i = 0; i < n; ++ i){
cin >> val;
a[i] = val;
mn = min(mn, val);
}
for(int i = 0; i < n; ++ i)
a[i] = (a[i] - mn) % T + mn;
sort(a.begin(), a.end());
int discomfort = (a[n-1] - a[0] + 1) / 2;
for(int i = n-2; i >= 0; -- i){
a[i+1] -= T;
discomfort = min(discomfort, (a[i] - a[i+1] + 1) / 2);
}
cout << discomfort;
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... |