UVA 562 Dividing coins --01背包的变形

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define N 50007

int c[102],dp[N];

int main()
{
    int t,n,i,v,V,sum;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        sum = 0;
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
            scanf("%d",&c[i]),sum += c[i];
        V = sum/2;
        for(i=1;i<=n;i++)
        {
            for(v=V;v>=c[i];v--)
                dp[v] = max(dp[v],dp[v-c[i]]+c[i]);
        }
        int maxi = -1;
        for(i=0;i<=V;i++)
            maxi = max(maxi,dp[i]);
        printf("%d\n",abs(sum-2*maxi));
    }
    return 0;
}