ZOJ1880 POJ2576 Tug of War，DP

/*******************************************************************************
# Author : Neo Fung
# Email : neosfung@gmail.com
# Last modified: 2012-08-03 20:16
# Filename: ZOJ1880 POJ2576 Tug of War.cpp
# Description :
******************************************************************************/
#ifdef _MSC_VER
#define DEBUG
#define _CRT_SECURE_NO_DEPRECATE
#endif

#include <fstream>
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <string>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <functional>
#include <ctype.h>
using namespace std;

const int kMAX=55;
bool dp[kMAX*2][kMAX*450];//dp[x][y]???x?????????y?
int value[2*kMAX];

int main(void)
{
#ifdef DEBUG
freopen("../stdin.txt","r",stdin);
freopen("../stdout.txt","w",stdout);
#endif

int n,ncase=1;

while(~scanf("%d",&n) && n)
{
int total=0;
memset(dp,false,sizeof(dp));
for(int i=0;i<n;++i)
{
scanf("%d",&value[i]);
total+=value[i];
}

int half=total>>1,idx=(n+1)/2;
for(int i=0;i<=idx;++i)dp[i][0]=true;
for(int i=0;i<n;++i)
{
for(int j=0;j<idx;++j)
{
for(int k=0;k+value[i]<=half;++k)
if(dp[j][k] && !dp[j+1][k+value[i]])
dp[j+1][k+value[i]]=true;
}
}

int ans=half;
while(!dp[idx][ans])
--ans;
int tmp=total-ans;
if(ans>tmp)
swap(ans,tmp);
printf("%d %d\n",ans,tmp);
}

return 0;
}