/**
* Author: distiled
*/
#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include </Users/distiled/codeStuff/templates/debug.h>
#else
#define dbg(x...)
#endif
#define int int64_t
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, p, q;
cin >> n >> p >> q;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
auto ok = [&] (int w) -> bool {
const int inf = int(1e9);
vector<vector<int>> dp(n + 1, vector<int>(min(n + 1, p + 1), inf));
dp[0][0] = 0;
for (int j = 1; j <= min(n, p); j++) {
int small = 1, large = 1;
dp[0][j] = 0;
for (int i = 1; i <= n; i++) {
while (small <= i) {
if (a[i] - a[small] + 1 > w) {
small += 1;
} else {
break;
}
}
while (large <= i) {
if (a[i] - a[large] + 1 > 2 * w) {
large += 1;
} else {
break;
}
}
dp[i][j] = min({dp[i][j], dp[small - 1][j - 1], dp[large - 1][j] + 1});
}
}
bool ok = false;
for (int j = 1; j <= min(n, p); j++) {
ok |= dp[n][j] <= q;
}
return ok;
};
int l = 0, r = int(1e9), ans = 1e9;
while (l <= r) {
int m = (l + r) >> 1;
if (ok(m)) {
r = m - 1;
ans = m;
} else {
l = m + 1;
}
}
cout << ans << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
