이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
constexpr size_t N = 300;
int32_t f[(N << 1) - 1][N], a[N], x[N], u[N], v[N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
size_t n, m = 0, last_playground = -1;
cin >> n;
int32_t sum_a = 0;
for (size_t i = 0; i < n; ++i)
{
cin >> a[i];
if (a[i] > 0)
x[m] = i, u[m] = last_playground, sum_a += a[i], ++m;
else if (a[i] == -1)
last_playground = i;
}
last_playground = n;
for (size_t i = n - 1, j = m - 1; i < n; --i)
{
if (a[i] >= 0)
v[j] = last_playground, --j;
else
last_playground = i;
}
for (size_t i = 0; i < (N << 1) - 1; ++i)
fill(f[i], f[i] + N, INT32_MIN);
for (size_t i = 0; i < m; ++i)
f[x[i]][i] = 0;
int32_t ans = 0;
for (size_t i = 0; i < (n << 1) - 1; ++i)
for (size_t j = 0; j < m; ++j)
{
ans = max(ans, f[i][j] + ((int32_t)i <= (x[j] << 1)));
for (size_t k = j + 1; k < m; ++k)
{
// Bring the candy of the j-th shop to the preceding playground.
if ((int32_t)i <= (x[j] << 1) && u[j] != -1 && (int32_t)i + x[j] + x[k] - (u[j] << 1) < (int32_t)(n << 1) - 1)
f[(int32_t)i + x[j] + x[k] - (u[j] << 1)][k] = max(f[(int32_t)i + x[j] + x[k] - (u[j] << 1)][k], f[i][j] + 1);
// Bring the candy of the j-th shop to the next playground.
if ((int32_t)i <= (x[j] << 1) && v[j] != (int32_t)n && (int32_t)i + v[j] - x[j] + abs(x[k] - v[j]) < (int32_t)(n << 1) - 1)
f[(int32_t)i + v[j] - x[j] + abs(x[k] - v[j])][k] = max(f[(int32_t)i + v[j] - x[j] + abs(x[k] - v[j])][k], f[i][j] + 1);
}
}
cout << sum_a - ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |