제출 #873393

#제출 시각아이디문제언어결과실행 시간메모리
873393vjudge1Kas (COCI17_kas)C++17
100 / 100
141 ms98652 KiB
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7, inf=1e9+7;
int n, a[N], s;
int f[502][N/2];
int calc(int k, int diff)
{
    if (diff > s/2) return -1e9;
    if (k == n+1)
    {
        if (diff) return -1e9;
        return 0;
    }
    if (f[k][diff]!=-1) return f[k][diff];
    return f[k][diff] = max({calc(k+1, diff),
                             calc(k+1, abs(diff-a[k])) + min(a[k], diff),
                             calc(k+1, diff+a[k])});
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n;
    for(int i=1; i<=n; ++i) cin >> a[i], s+=a[i];
    memset(f, -1, sizeof f);
    int ans = calc(1, 0);
    ans += s - 2*ans;
    cout << 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...