#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, p, q, a = 0 , b;
vector<int> A;
vector<vector<int>> dp(2010, vector<int> (2010, 0));
bool can(int w) {
a = 0;
dp[0][0] = 0;
int I = min(n, q);
int J = min(n, q);
for(int i = 0;i<=I;i++) {
for(int j = 0;j<=J;j++) {
if(i == 0 and j == 0) continue;
if(i > 0)
{
a=dp[i-1][j];
b = a;
while(a<n and A[b]+2*w-1>=A[a])
a++;
}
dp[i][j]=a;
if(j > 0)
{
a=dp[i][j-1];
b = a;
while(a<n and A[b]+2*w-1>=A[a])
a++;
}
dp[i][j]=max(a, dp[i][j]);
}
}
return (dp[I][J]>=n);
}
int32_t main () {
cin >> n >> p >> q;
for(int i = 0;i<n;i++) {
int ai;
cin >> ai;
A.push_back(ai);
}
sort(A.begin(), A.end());
int r = 1e9, l = 0, ans = 0;
while(l<=r) {
int mid = (l+r)/2;
if(can(mid)) {
ans = mid;
r = mid - 1;
}
else {
l = mid + 1;
}
}
cout<<ans<<endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
15 ms |
31948 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
16 ms |
31920 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
