NYOJ(325)+NYOJ(456),01背包

#include <stdio.h>
#include <math.h>
#include <string.h>

int val[10050];
int dp [200050];

int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        memset(dp,0,sizeof(dp));
        memset(val,0,sizeof(val));

        int sum = 0;
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&val[i]);
            sum+=val[i];
        }
        for(int i=1; i<=n; i++)
        {
            for(int j=sum/2; j>=val[i]; j--)
                dp[j]=(dp[j]>dp[j-val[i]]+val[i]?dp[j]:dp[j-val[i]]+val[i]);
        }
        int tmp1 = dp[sum/2];
        int tmp2 = sum - tmp1;
        int ans = (int)fabs(tmp1-tmp2);
        printf("%d\n",ans);
    }
    return 0;
}