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 ll long long
#define INF 1000000000
int n, p, q;
vector<int> a;
int main(){
cin>>n>>p>>q;
a.assign(n + 1, 0);
for (int i = 1; i <= n; i++){
cin>>a[i];
}
sort(a.begin(), a.end());
if (n <= p + q){
cout<<1;
return 0;
}
ll dp[n + 1][q + 1][p + 1];
for (int i = 0; i <= n; i++){
for (int j = 0; j <= p; j++){
for (int k = 0; k <= q; k++){
dp[i][j][k] = 0;
}
}
}
for (int i = 1; i <= n; i++){
for (int j = 0; j <= p; j++){
for (int k = 0; k <= q; k++){
if (p + q >= i){
dp[i][j][k] = 1;
continue;
}
dp[i][j][k] = INF;
for (int l = 0; l < i; l++){
ll dist = a[i] - a[l + 1] + 1;
ll bi = ceil((double)dist / (double)2);
if (j != 0){
dp[i][j][k] = min(max(dp[l][j - 1][k], dist), dp[i][j][k]);
}
if (k != 0){
dp[i][j][k] = min(max(dp[l][j][k - 1], bi), dp[i][j][k]);
}
}
}
}
}
cout<<dp[n][p][q];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |