poj 2576

Tug of War Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 6615   Accepted: 1658 Description A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two teams must not differ by more than 1; the total weight of the people on each team should be as nearly equal as possible. Input The first line of input contains n the number of people at the picnic. n lines follow. The first line gives the weight of person 1; the second the weight of person 2; and so on. Each weight is an integer between 1 and 450. There are at most 100 people at the picnic. Output Your output will be a single line containing 2 numbers: the total weight of the people on one team, and the total weight of the people on the other team. If these numbers differ, give the lesser first. Sample Input 3 100 90 200 Sample Output 190 200 Source Waterloo local 2000.09.30

分析：用了DP，不过貌似有O(n^2)的解法，忘记了。。。。哪个神牛指教一下

#include<iostream> using namespace std; int n,w[103],sum,ans,l,r; bool dp[45005][103]; int main() { //freopen("car.in","r",stdin); //freopen("car.out","w",stdout); memset(dp, 0, sizeof(dp)); scanf("%d", &n); sum=0; for(int i=1;i<=n;i++)scanf("%d",&w[i]),sum+=w[i]; dp[0][0]=dp[0][101]=1; for(int i=1;i<=n;++i) for(int j=sum;j>=w[i];--j) if(dp[j-w[i]][101]) { dp[j][101]=1; for(int k=0;k<n;k++) if(dp[j-w[i]][k])dp[j][k+1]=1; } ans=sum/2; while(!(dp[ans][101]&&(dp[ans][n/2]||dp[ans][(n+1)/2])))--ans; printf("%d %d/n",ans,sum-ans); return 0; }