#include<bits/stdc++.h>
using namespace std;
vector<int> a;
int n, p, q;
int binser(int x) {
int l=0, r=n-1, ans=-1;
while(l<=r) {
int mid=(l+r)/2;
if(a[mid]<x) ans=mid, l=mid+1;
else r=mid-1;
}
return ans;
}
bool can(int w) {
vector<vector<int>> dp(n, vector<int>(p+1));
for(auto &p : dp) for(int &pp : p) pp=1e4;
dp[0][0]=1;
for(int i=1; i<=p; i++) dp[0][1]=0;
for(int i=1; i<n; i++) {
for(int j=0; j<=p; j++) {
int SMALL=binser(a[i]-w+1), BIG=binser(a[i]-2*w+1);
if(j) {
if(SMALL==-1) dp[i][j]=0;
else dp[i][j]=min(dp[i][j], dp[SMALL][j-1]);
}
if(BIG==-1) dp[i][j]=min(dp[i][j], 1);
else dp[i][j]=min(dp[i][j], dp[BIG][j]+1);
}
}
for(int i=0; i<=p; i++) {if(dp[n-1][i]<=q) return 1;}
return 0;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> p >> q;
a.resize(n);
for(int &p : a) cin >> p;
if(p+q>=n) {cout << "1\n"; return 0;}
sort(a.begin(), a.end());
int l=1, r=2000, w=2000;
while(l<=r) {
int mid=(l+r)/2;
if(can(mid)) w=mid, r=mid-1;
else l=mid+1;
}
cout << w << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
332 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
