#include <stdio.h>
#define N 5000
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int aa[N], dp[N * 2 + 1];
int n, h, i, j, k, r, ans;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
for (k = 0; k <= n * 2; k++)
dp[k] = -INF;
dp[0] = 0;
for (i = -1, j = 0; j <= n; j++)
if (j == n || aa[j] == -1) {
int d_, h_, i_, j_;
d_ = -1, h_ = -1;
for (h = i + 1; h <= j; h++)
if (aa[h] > 0) {
int d;
d = INF;
if (i != -1)
d = min(d, h - i);
if (j != n)
d = min(d, j - h);
if (d_ < d)
d_ = d, h_ = h;
}
i_ = max(i, 0), j_ = min(j, n - 1);
if (d_ == -1) {
for (k = 0; k <= n * 2; k++)
if (dp[k] != -INF)
dp[k] += j_ - i_;
} else {
aa[h_]--;
for (h = i + 1; h < h_; h++)
for (r = 0; r < aa[h]; r++)
for (k = n * 2; k >= 0; k--)
if (dp[k] != -INF && dp[k] + h - i >= 0)
dp[k + 1] = max(dp[k + 1], dp[k] - (h - i) * 2);
for (k = n * 2; k >= 0; k--)
if (dp[k] != -INF)
if (dp[k] + i_ - h_ >= 0)
dp[k + 1] = max(dp[k + 1], dp[k] + j_ - i_);
else
dp[k] = max(dp[k], dp[k] + j_ - i_);
for (h = h_; h < j; h++)
for (r = 0; r < aa[h]; r++)
for (k = n * 2; k >= 0; k--)
if (dp[k] != -INF && dp[k] - (j - h) * 3 >= 0)
dp[k + 1] = max(dp[k + 1], dp[k] - (j - h) * 2);
aa[h_]++;
}
i = j;
}
ans = 0;
for (i = 0; i < n; i++)
if (aa[i] > 0)
ans += aa[i];
k = 0;
while (k < n * 2 && dp[k + 1] != -INF)
k++;
ans -= k;
printf("%d\n", ans);
return 0;
}
Compilation message
tortoise.c: In function 'main':
tortoise.c:49:9: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
49 | if (dp[k] != -INF)
| ^
tortoise.c:13:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
13 | scanf("%d", &n);
| ^~~~~~~~~~~~~~~
tortoise.c:15:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
15 | scanf("%d", &aa[i]);
| ^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
280 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
280 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
280 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
280 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
280 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
