#include <bits/stdc++.h>
#define ii pair <int, int>
#define x first
#define y second
#define db(x) cerr << #x << " = " << x << endl;
using namespace std;
inline void read(int &x){register int c = getchar();x = 0; int neg = 0;for (;((c<48 || c>57) && c != '-') ;c = getchar());if(c=='-') {neg=1;c=getchar();}for(;c>47 && c<58;c = getchar()) {x = (x<<1) + (x<<3) + c - 48;}if(neg) x=-x;}
inline void read(long long &x){register int c = getchar();x = 0; int neg = 0;for (;((c<48 || c>57) && c != '-') ;c = getchar());if(c=='-') {neg=1;c=getchar();}for(;c>47 && c<58;c = getchar()) {x = (x<<1) + (x<<3) + c - 48;}if(neg) x=-x;}
inline void writeln(long long x){char buffor[21];register int i=0;int neg=0; if (x<0) {neg=1; x= -x;}do{buffor[i++]=(x%10)+'0';x/=10;} while(x);i--;if (neg) putchar('-');while(i>=0) putchar(buffor[i--]);putchar('\n');}
inline void write(long long x){char buffor[21];register int i=0;int neg=0; if (x<0) {neg=1; x= -x;}do{buffor[i++]=(x%10)+'0';x/=10;} while(x);i--;if (neg) putchar('-');while(i>=0) putchar(buffor[i--]);putchar(' ');}
const int N = 2007;
int n, p, q;
int a[N];
int f[N][N];
ii nxt[N];
inline int BS(int i, long long d){
int l = i;
int r = n;
while (l <= r){
int mid = (l + r) / 2;
if (a[mid] - a[i] + 1 <= d)
l = mid + 1;
else
r = mid - 1;
}
return r;
}
bool check(int x){
for (int i = 1; i <= n; i++){
nxt[i].x = BS(i, x);
nxt[i].y = BS(i, 2 * x);
}
for (int i = 0; i <= p; i++)
for (int j = 0; j <= q; j++){
f[i][j] = 0;
if (j) f[i][j] = max(f[i][j], nxt[f[i][j - 1] + 1].y);
if (i) f[i][j] = max(f[i][j], nxt[f[i - 1][j] + 1].x);
if (f[i][j] >= n) return true;
}
return false;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
read(n); read(p); read(q);
p = min(p, n); q = min(q, n);
for (int i = 1; i <= n; i++)
read(a[i]);
sort(a + 1, a + n + 1);
int l = 1;
int r = 1000000000;
while (l <= r){
int mid = (l + r) / 2;
if (check(mid))
r = mid - 1;
else
l = mid + 1;
}
writeln(l);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 2 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 3 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 4 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 5 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 6 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 7 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 8 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 9 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 10 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 11 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 12 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 13 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 14 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 15 |
Correct |
0 ms |
17932 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
17932 KB |
Output is correct |
| 2 |
Correct |
0 ms |
17932 KB |
Output is correct |
| 3 |
Correct |
39 ms |
17932 KB |
Output is correct |
| 4 |
Correct |
19 ms |
17932 KB |
Output is correct |
| 5 |
Correct |
3 ms |
17932 KB |
Output is correct |
| 6 |
Correct |
6 ms |
17932 KB |
Output is correct |
| 7 |
Correct |
9 ms |
17932 KB |
Output is correct |
| 8 |
Correct |
16 ms |
17932 KB |
Output is correct |
| 9 |
Correct |
19 ms |
17932 KB |
Output is correct |
| 10 |
Correct |
29 ms |
17932 KB |
Output is correct |
| 11 |
Correct |
13 ms |
17932 KB |
Output is correct |
| 12 |
Correct |
83 ms |
17932 KB |
Output is correct |
| 13 |
Correct |
3 ms |
17932 KB |
Output is correct |
| 14 |
Correct |
3 ms |
17932 KB |
Output is correct |
| 15 |
Correct |
3 ms |
17932 KB |
Output is correct |
