Submission #202087

#	Time	Username	Problem	Language	Result	Execution time	Memory
202087		algorithm16	Kas (COCI17_kas)	C++14	30 / 100	30 ms	3832 KiB

kas

#include<iostream>
#include<algorithm>
using namespace std;
int dp[505][2005],arr[505],sum,n;
int rek(int ind,int x,int y) {
     if(ind==n) {
          if(x==y) return x;
          return -1e9;
     }
     if(dp[ind][int(x-y+1e3)]!=0) return dp[ind][int(x-y+1e3)];
     int ret=max(rek(ind+1,x,y),max(rek(ind+1,x+arr[ind],y),rek(ind+1,x,y+arr[ind])));
     dp[ind][int(x-y+1e3)]=ret;
     return ret;
}
int main()
{
     cin >> n;
     for(int i=0;i<n;i++) {
          cin >> arr[i];
          sum+=arr[i];
     }
     int sol=rek(0,0,0);
     cout << sum-sol;
     return 0;
}

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