# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
732242 | blackslex | Kas (COCI17_kas) | C++17 | 156 ms | 87268 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 = 505, M = 1e5 + 5;
int n, ans, a[N], dp[N][M];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), ans += a[i];
for (int i = 1; i <= n; i++) {
for (int j = M - 1; j >= 1; j--) if (dp[i - 1][j]) dp[i][j + a[i]] = max(dp[i][j + a[i]], dp[i - 1][j] + a[i]), dp[i][abs(a[i] - j)] = max(dp[i][abs(a[i] - j)], dp[i - 1][j] + a[i]), dp[i][j] = max(dp[i][j], dp[i - 1][j]);
dp[i][a[i]] = max({dp[i][a[i]], dp[i - 1][0] + a[i], dp[i - 1][a[i]]});
}
printf("%d", ans - (dp[n][0] >> 1));
}
Compilation message (stderr)
# | 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... |
# | 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... |