| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 909579 | schzeey | Watching (JOI13_watching) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int ll
int n, a, b;
vector <int> arr;
bool check(int ans){
vector<vector<int>> dp(a+1, vector<int>(n+1, 0));
for (int i = 0; i < a+1; ++i){
for (int j = 1; j <= n; ++j){
int pa = j, pb = j;
do pa--; while(arr[j]-arr[pa] <= ans);
do pb--; while(arr[j]-arr[pb] <= 2*ans);
if (i == 0) dp[i][j] = dp[i][pb]+1;
else dp[i][j] = min(dp[i][pb]+1, dp[i-1][pa]);
}
}
return dp[a][n] <= b;
}
int main(){
cin >> n >> a >> b;
arr.resize(n+1);
for (int i = 1; i <= n; ++i) cin >> arr[i];
if (a+b >= n) return cout<<1, 0;
arr[0] = -1e9;
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;
}