제출 #244974

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
244974		Vladikus004	Kas (COCI17_kas)	C++14	0 / 100	5 ms	640 KiB

kas

#include <bits/stdc++.h>
#define inf 2e9
#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 = 30;
int n, a[N], dp[N][MAX], was[N][MAX];

int get_ans(int ind, int diff){
    if (was[ind][diff]) return dp[ind][diff];
    was[ind][diff] = 1;
    if (ind == n - 1){
        if (diff == a[ind]) return a[ind];
        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];
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n;
    int sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
    }
    int ans = get_ans(0, 0);
    cout << ans / 2 + sum - ans;
}

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