# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
237566 | jingyanyu | Watching (JOI13_watching) | C++17 | 226 ms | 16124 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;
const int N = 2005;
int a[N], dp[N][N];
int main() {
int n, p, q;
scanf("%d%d%d", &n, &p, &q);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
sort(a + 1, a + n + 1);
int l = 1, r = 1000000000, res;
while(r - l >= 0) {
int mid = (l + r) >> 1;
dp[0][0] = 0;
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)dp[i][j]=n+1;
for (int i = 1; i <= n; i++) {
int pp = 1, pq = 1;
for (int j = i; j >= 1; j--) {
if (a[i] - a[j] + 1 <= mid) pp = j;
if (a[i] - a[j] + 1 <= 2*mid) pq = j;
}
dp[i][0] = dp[pq - 1][0] + 1;
for (int j = 1; j <= min(i, p); j++) {
dp[i][j] = min(dp[pp - 1][j - 1], dp[pq - 1][j] + 1);
}
}
int mn = dp[n][0];
for (int i = 1; i <= n; i++) {
mn = min(mn, dp[n][i]);
}
if (mn <= q) {
r = mid - 1;
res = mid;
} else {
l = mid + 1;
}
}
printf("%d\n", res);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |