Submission #245106

#TimeUsernameProblemLanguageResultExecution timeMemory
245106Vladikus004Kas (COCI17_kas)C++14
0 / 100
335 ms159224 KiB
#include <bits/stdc++.h> #define inf 2e9 #define int long long #define all(v) v.begin(), v.end() using namespace std; typedef long long ll; typedef long double ld; typedef pair <int, int> pii; const int N = 505, MAX = 100000 + 5; int n, a[N], dp[N][MAX], was[N][MAX], sum; int get_ans(int ind, int diff){ if (was[ind][diff]) return dp[ind][diff]; was[ind][diff] = 1; if (ind == n){ if (diff == 0) return 0; return -inf; } dp[ind][diff] = max(get_ans(ind + 1, diff), max(get_ans(ind + 1, diff + a[ind]), get_ans(ind + 1, abs(diff - a[ind]))) + a[ind]); return dp[ind][diff]; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); #ifdef LOCAL freopen("input.txt", "r", stdin); #endif // LOCAL cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; sum += a[i]; } int ans = get_ans(0, 0); // cout << ans << "\n"; cout << ans / 2 + sum - ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...