제출 #1187960

#제출 시각아이디문제언어결과실행 시간메모리
1187960prideliqueeeKas (COCI17_kas)C++20
100 / 100
149 ms3540 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
    int n;
    cin>>n;
    int a[n+1];
    int sum=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        sum+=a[i];
    }
    int dp[2][200010];
    for(int i=0;i<=200009;i++)
    dp[0][i]=LLONG_MIN;
    dp[0][100000]=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=100000-sum;j<=100000+sum;j++)
        {
            dp[i%2][j]=dp[(i-1)%2][j];
            if(j>=a[i])
            dp[i%2][j]=max(dp[i%2][j],dp[(i-1)%2][j-a[i]]+a[i]);
            if(j+a[i]<=200009)
            dp[i%2][j]=max(dp[i%2][j],dp[(i-1)%2][j+a[i]]+a[i]);
        }
    }
    cout<<((sum-dp[n%2][100000])*2+dp[n%2][100000])/2;
}
#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...