九度oj 1420：Jobdu MM分水果

http://ac.jobdu.com/problem.php?id=1420

View Code

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cmath>
 4 #include<cstdlib>
 5 using namespace std;
 6 int main()
 7 {
 8     int n;
 9     while(cin>>n)
10     {
11        int *a=new int[n];
12        int i,j,sum=0;
13        for(i=0;i<n;i++) cin>>a[i],sum+=a[i];
14        int total=sum>>1;
15        int *bag=new int[total+2];
16        memset(bag,0,sizeof(int)*(total+2));
17        for(i=0;i<n;i++)
18        for(j=total;j>=a[i];j--)
19        {
20           bag[j]=max(bag[j],bag[j-a[i]]+a[i]);//背包 
21        }
22        //cout<<bag[total]<<endl;
23        cout<<abs(sum-2*bag[total])<<endl;
24        delete a;
25        delete bag;
26     }
27     return 0;
28 } 

 

转载于:https://www.cnblogs.com/keepmoving89/archive/2012/03/28/2421893.html