HDU 1171

母函数简单题

#include <iostream>
#include <cstdio>
using namespace std;

const int MAX=130000;
int c1[MAX],c2[MAX];

struct {
    int val,num;
}thing[55];
int n;

int main(){
    while(scanf("%d",&n)!=EOF){
        if(n<0) break;
        int sum=0,tmp;
        for(int i=1;i<=n;i++){
            scanf("%d%d",&thing[i].val,&thing[i].num);
            sum+=(thing[i].val*thing[i].num);
        }
        tmp=sum/2;
        for(int i=0;i<=tmp;i++)
        c1[i]=c2[i]=0;
        for(int i=0,k=0; i<=tmp&&k<=thing[1].num; i+=thing[1].val,k++)
        c1[i]=1;
        for(int i=2;i<=n;i++){
            for(int j=0;j<=tmp; j++){
                if(c1[j]>=1){
                    for(int k=0,p=0; k+j<=tmp&&p<=thing[i].num; k+=thing[i].val,p++){
                        c2[j+k]+=c1[j];
                    }
                }
            }
            for(int j=0;j<=tmp;j++){
                c1[j]=c2[j]; c2[j]=0;
            }
        }
        for(int i=tmp;i>=0;i--){
            if(c1[i]){
                printf("%d %d
",sum-i,i);
                break;
            }
        }
    }
    return 0;
}