제출 #442976

#제출 시각아이디문제언어결과실행 시간메모리
442976zxcvbnmKas (COCI17_kas)C++14
0 / 100
11 ms8792 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxS = 1e5 + 5; const int INF = 1e9 + 5; int dp[105][100][100]; vector<int> a; int n; int go(int k, int x, int y) { if (dp[k][x][y] != -1) { return dp[k][x][y]; } int& ret = dp[k][x][y]; if (k == n) { return ret = (x == y ? 0 : -INF); } return ret = max({go(k+1, x, y), go(k+1, x+a[k], y)+a[k], go(k+1, x, y+a[k])+a[k]}); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); memset(dp, -1, sizeof dp); cin >> n; a.resize(n); for(int i = 0; i < n; i++) { cin >> a[i]; } int sum = accumulate(a.begin(), a.end(), 0); int sol = go(0, 0, 0); cout << (sol / 2) + (sum - sol); }
#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...