51nod 1007 正整数分组

http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1007

就是一个简单的01背包问题。

#include<iostream>
#include<algorithm>
#include<stdio.h>
#define maxn 105
#define max1 10005
using namespace std;
int beibao[maxn];
int w[max1];
int main()
{
    int n,sum=0;
    scanf("%d",&n);
    for(int x=0;x<n;x++)
        scanf("%d",&beibao[x]),sum+=beibao[x];
    for(int x=0;x<n;x++)
        for(int j=sum/2;j>=beibao[x];j--)
            w[j]=max(w[j],w[j-beibao[x]]+beibao[x]);
    printf("%d\n",abs(sum-w[sum/2]*2));
}