NYOJ 456 邮票分你一半

http://acm.nyist.net/JudgeOnline/problem.php?pid=456

0/1背包问题

#include <iostream>
#define maxn 100005
using namespace std;
int ans[maxn], v[maxn];
int main()
{
    long t, n, i, j, sum, m;
    cin >> t;
    while(t--)
    {
        cin >> n;
        sum  = 0;
        for(i = 0; i < n; i++)
        {
            cin >> v[i];
            sum += v[i];
        }
        m = sum/2;
        for(i = 0; i <= m; i++)
        ans[i] = 0;
        for(i = 0; i < n; i++)
        {
            for(j = m; j >= v[i]; j--)
            if(ans[j-v[i]]+v[i] > ans[j])
            ans[j] = ans[j-v[i]]+v[i];
        } 
        cout << sum - 2*ans[m] << endl;
    }
    return 0;
}