# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
32276 | cscandkswon | Kas (COCI17_kas) | C++14 | 216 ms | 197608 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 <cstdio>
#include <cstdlib>
const int MAXN = 503, INF=1e9;
int N, A[MAXN], S, ans, D[MAXN][100005];
inline int max(int a, int b) { return (a > b) ? a : b; }
int func(int a, int d) {
if (d > S / 2) return -INF;
if (a == N) {
if (d == 0) return D[a][d];
return -INF;
}
if (D[a][d]) return D[a][d];
D[a][d] = max(func(a + 1, d), max(func(a + 1, d + A[a]) + A[a], func(a + 1, abs(d - A[a]))));
return D[a][d];
}
int main() {
int i;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", A + i), S+=A[i];
ans = func(0, 0);
if (ans < 0) ans = 0;
printf("%d", ans + (S - ans * 2));
return 0;
}
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... |