#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, a, b;
vector <int> arr;
bool check(int ans){
vector<vector<int>> dp(n+1, vector<int>(a+1, 0));
for (int i = 1; i <= n; ++i){
int pa = i, pb = i;
do pa--; while(pa != 0 && arr[i]-arr[pa] <= ans-1);
do pb--; while(pb != 0 && arr[i]-arr[pb] <= 2*ans-1);
for (int j = 0; j < a+1; ++j){
if (i == 0) dp[i][j] = dp[pb][j]+1;
else dp[i][j] = min(dp[pb][j]+1, dp[pa][j-1]);
}
}
return dp[n][a] <= b;
}
int32_t main(){
cin >> n >> a >> b;
arr.resize(n+1);
arr[0] = -1;
for (int i = 1; i <= n; ++i) cin >> arr[i];
if (a+b >= n) return cout<<1, 0;
sort(arr.begin(), arr.end());
//for (auto e: arr) cout << e << " ";
int lf = 0, ri = 1e9;
while (lf <= ri){
int mid = (lf+ri)/2;
//cout << mid << " ";
if (check(mid)) ri = mid-1;
else lf = mid+1;
}
cout << lf+1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
46 ms |
532 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
