HDU 1171 多重背包

这道题目真是各种小陷阱啊！我发现了必须看题，我一开始做时，看一下直接是以输入-1为终止条件，可是提交上去就是一直错，哎！后来看了别人代码发现是N>=0，再看一下题目的确啊！是以负整数输入为终止条件！！！还有这题就是范围不是题目所给的！一定要开大来！！！这样就能AC了！！#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=2000000;int value[60],acount[60],f[maxn];int n, sum,v;void zeropack(int cost1,int value1){    for(int i=v; i>=cost1; i--)    {        f[i]=max(f[i],f[i-cost1]+value1);    }}void completpack(int cost1,int value1){    for(int i=cost1; i<=v; i++)    {        f[i]=max(f[i],f[i-cost1]+value1);    }}void multiplepack(int cost1,int value1,int acount1){    if(cost1*acount1>=v)    {        completpack(cost1,value1);        return ;    }    else    {        int k=1;        while(k<acount1)        {            zeropack(k*cost1,k*value1);            acount1=acount1-k;            k=k*2;        }        zeropack(acount1*cost1,acount1*value1);    }}int main(){    int i;    while(scanf("%d",&n),n>=0)    {        memset(value,0,sizeof(value));        memset(acount,0,sizeof(acount));        memset(f,0,sizeof(f));        sum=0;        for(i=1; i<=n; i++)        {            scanf("%d%d",&value[i],&acount[i]);            sum+=value[i]*acount[i];        }        v=sum/2;        for(i=1; i<=n; i++)        {            multiplepack(value[i],value[i],acount[i]);        }        printf("%d %d\n",sum-f[v],f[v]);    }    return 0;}