#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll, ll>
#define fi first
#define sec second
#define ld long double
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
const int MAXN = 5e5;
const ll INF = 1e18;
const int MOD = 1e9 + 7;
ll A[MAXN + 5];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int tc = 1;
// cin >> tc;
for(;tc--;){
ll N, T; cin >> N >> T;
for(int i = 1; i <= N; i++){
cin >> A[i];
A[i] %= T;
}
ll ans = INF;
for(int i = 0; i < T; i++){
ll cur = 0;
for(int j = 1; j <= N; j++){
cur = max(cur, min({abs(A[j] - i), abs((i + T) - A[j]), abs(i - (A[j] + T))}));
}
ans = min(ans, cur);
}
cout << ans << "\n";
}
}
/*
3 6 5 1 5 1
*/
| # | 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... |