poj 2576

背包问题，二维的dp.

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 110;
const int maxw = 45010;
int num[maxn];
bool dp[maxn][maxw];
int main()
{
    int m;
    while(~scanf("%d",&m)){
        int sum = 0;
        for(int i=0; i<m; ++i){
            scanf("%d",&num[i]);
            sum += num[i];
        }
        memset(dp,false,sizeof(dp));
        dp[0][0] = true;
        for(int i=0; i<m; ++i)
          for(int j=0; j<=sum; ++j)
            for(int k=0; k<=m/2; ++k)
              if(dp[k][j])
                dp[k+1][j+num[i]] = true;
            int MIN = 100000;
            int ans;
       for(int i=sum; i>=0; --i)
            if(dp[m/2][i] &&abs(sum-2*i)<MIN){
                MIN = abs(sum-2*i);
                ans = i;
            }
       if(ans < sum/2) printf("%d %d\n",ans,sum - ans);
       else printf("%d %d\n",sum-ans,ans);
    }
    return 0;
}