제출 #442977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442977		zxcvbnm	Kas (COCI17_kas)	C++14	70 / 100	336 ms	441276 KiB

kas

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxS = 1e5 + 5;
const int INF = 1e9 + 5;

int dp[55][1005][1005];
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 ? x : -INF);
    }

    return ret = max({go(k+1, x, y), go(k+1, x+a[k], y), go(k+1, x, y+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) + (sum - (sol*2));
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10