This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 1, N = 500 + 1, inf = 1e9;
int cnt[M],pre[N][M*2],temp[M*2];
int main()
{
int n;
cin>>n;
int su=0,a[n];
for (int i=0;i<n;i++)
cin>>a[i],su+=a[i];
for (int i=0;i<M*2;i++)
temp[i]=pre[0][i]=-inf;
temp[M]=pre[0][M]=0;
for (int i=0;i<n;i++)
{
for (int j=0;j<M*2;j++)
{
if (j+a[i]<M*2)
temp[j+a[i]]=max(temp[j+a[i]],pre[i][j]+a[i]);
if (j-a[i]>=0)
temp[j-a[i]]=max(temp[j-a[i]],pre[i][j]+a[i]);
}
for (int j=0;j<M*2;j++)
pre[i+1][j]=temp[j];
}
int div=pre[n][M];
cout<<div/2+su-div<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |