#include<bits/stdc++.h>
using namespace std;
int dp[2005][2005];
int n,p,q;
int a[2005];
bool check(int x) {
for(int i=1; i<=n; i++)
for(int j=0; j<=p; j++)
dp[i][j]=1e9;
for(int i=0; i<=p; i++)dp[0][i]=0;
int dd1=1,dd2=1;
for(int i=1; i<=n; i++) {
while(a[i]-a[dd1]+1>x)dd1++;
while(a[i]-a[dd2]+1>2*x)dd2++;
for(int j=0; j<=p; j++) {
dp[i][j]=min(dp[i][j],dp[dd2-1][j]+1);
dp[i][j+1]=min(dp[i][j+1],dp[dd1-1][j]);
}
}
return dp[n][p]<=q;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>p>>q;
for(int i=1; i<=n; i++)cin>>a[i];
sort(a+1,a+n+1);
p=min(p,n);
q=min(q,n);
int l=1,r=1e9,mid,kq=1e9;
while(l<=r) {
mid=(l+r)/2;
if(check(mid)==1) {
r=mid-1;
kq=mid;
} else l=mid+1;
}
cout<<kq;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
724 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
724 KB |
Output is correct |
5 |
Correct |
1 ms |
724 KB |
Output is correct |
6 |
Correct |
1 ms |
724 KB |
Output is correct |
7 |
Correct |
1 ms |
724 KB |
Output is correct |
8 |
Correct |
1 ms |
724 KB |
Output is correct |
9 |
Correct |
1 ms |
712 KB |
Output is correct |
10 |
Correct |
1 ms |
724 KB |
Output is correct |
11 |
Correct |
1 ms |
724 KB |
Output is correct |
12 |
Correct |
1 ms |
724 KB |
Output is correct |
13 |
Correct |
1 ms |
608 KB |
Output is correct |
14 |
Correct |
1 ms |
724 KB |
Output is correct |
15 |
Correct |
1 ms |
724 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
8380 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
166 ms |
16036 KB |
Output is correct |
4 |
Correct |
190 ms |
16044 KB |
Output is correct |
5 |
Correct |
12 ms |
8992 KB |
Output is correct |
6 |
Correct |
187 ms |
16032 KB |
Output is correct |
7 |
Correct |
6 ms |
8404 KB |
Output is correct |
8 |
Correct |
19 ms |
9300 KB |
Output is correct |
9 |
Correct |
75 ms |
14276 KB |
Output is correct |
10 |
Correct |
190 ms |
16036 KB |
Output is correct |
11 |
Correct |
14 ms |
9080 KB |
Output is correct |
12 |
Correct |
99 ms |
16028 KB |
Output is correct |
13 |
Correct |
5 ms |
8396 KB |
Output is correct |
14 |
Correct |
6 ms |
8528 KB |
Output is correct |
15 |
Correct |
8 ms |
8404 KB |
Output is correct |