#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int n, l, r;
vector<int> a;
bool poss(int x) {
int sz = 1, mx = a[0], mn = a[0];
for(int i = 1; i < n; i++) {
if (abs(a[i] - mx) > x || abs(a[i] - mn) > x || sz == r || (n-i == l && (sz + n-i) > r)) {
if (sz < l) return false;
sz = 1;
mx = a[i];
mn = a[i];
} else {
sz++;
mx = max(mx, a[i]);
mn = min(mn, a[i]);
}
}
return sz >= l && sz <= r;
}
int bsearch() {
int L = 0, R = 1e7, ans = R;
while(L <= R) {
int mid = (L + R) / 2;
if (poss(mid)) {
ans = mid;
R = mid - 1;
} else {
L = mid + 1;
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> l >> r;
a.resize(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = bsearch();
reverse(a.begin(), a.end());
ans = min(ans, bsearch());
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
27 ms |
748 KB |
Output is correct |
3 |
Correct |
3 ms |
364 KB |
Output is correct |
4 |
Correct |
308 ms |
4204 KB |
Output is correct |
5 |
Correct |
319 ms |
4236 KB |
Output is correct |
6 |
Correct |
30 ms |
748 KB |
Output is correct |
7 |
Correct |
280 ms |
3820 KB |
Output is correct |
8 |
Correct |
0 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
27 ms |
748 KB |
Output is correct |
3 |
Correct |
3 ms |
364 KB |
Output is correct |
4 |
Correct |
308 ms |
4204 KB |
Output is correct |
5 |
Correct |
319 ms |
4236 KB |
Output is correct |
6 |
Correct |
30 ms |
748 KB |
Output is correct |
7 |
Correct |
280 ms |
3820 KB |
Output is correct |
8 |
Correct |
0 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
16 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
17 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
27 ms |
748 KB |
Output is correct |
3 |
Correct |
3 ms |
364 KB |
Output is correct |
4 |
Correct |
308 ms |
4204 KB |
Output is correct |
5 |
Correct |
319 ms |
4236 KB |
Output is correct |
6 |
Correct |
30 ms |
748 KB |
Output is correct |
7 |
Correct |
280 ms |
3820 KB |
Output is correct |
8 |
Correct |
0 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
16 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
17 |
Halted |
0 ms |
0 KB |
- |