Submission #98349

#	Time	Username	Problem	Language	Result	Execution time	Memory
98349		MohamedAhmed0	Kas (COCI17_kas)	C++14	100 / 100	1538 ms	395808 KiB

kas

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 505 ;
const int MAXSUM = 100010 ;
const int CONS = 100000 ;
int arr[MAXN] ;
int dp[MAXN][MAXSUM+CONS] ;
int n ;

int solve(int idx , int diff)
{
    if(idx == n)
    {
        if(diff - CONS == 0)
            return 0 ;
        return -1e8 ;
    }
    int &ret = dp[idx][diff] ;
    if(ret != -1)
        return ret ;
    ret = solve(idx+1 , diff) ;
    ret = max(ret , solve(idx+1 , diff + arr[idx]) + arr[idx]) ;
    ret = max(ret , solve(idx+1 , diff - arr[idx]) + arr[idx]) ;
    return ret ;
}

int main()
{
    memset(dp , -1 , sizeof(dp)) ;
    cin>>n ;
    int sum = 0 ;
    for(int i = 0 ; i < n ; ++i)
    {
        cin>>arr[i] ;
        sum += arr[i] ;
    }
    int ans = solve(0 , CONS) ;
    //debugging
    if(ans & 1)
        while(1) ;
    return cout<<ans/2+sum-ans<<"\n" , 0 ;
}

• 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: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10