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;
#define ll int
#define MAXN 505
#define MAXS 200005
#define FOR(i, a, b) for(ll i = a; i <= b; i++)
ll n, dp[MAXN][MAXS], s = 0;
int main(){
cin >> n;
FOR(i, 0, MAXN - 5) FOR(j, 0, MAXS - 5) dp[i][j] = MAXS;
dp[0][100000] = 0;
FOR(i, 1, n){
int x; cin >> x;
s += x;
FOR(j, x, 200000 - x){
dp[i][j - x] = min(dp[i][j - x], dp[i - 1][j]);
dp[i][j + x] = min(dp[i][j + x], dp[i - 1][j]);
dp[i][j] = min(dp[i][j], dp[i - 1][j] + x);
}
}
cout << ((s - dp[n][100000]) / 2 + dp[n][100000]) << endl;
}
# | 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... |