poj 3624 Charm Bracelet

http://poj.org/problem?id=3624

分析：01背包，不用装满

#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int NUM=3405;int weight[NUM],vau[NUM],f[12900];int main(){int i,j,N,M;while(scanf("%d%d",&N,&M)!=EOF){for(i=1;i<=N;i++)scanf("%d%d",&weight[i],&vau[i]);memset(f,0,sizeof(f));for(i=1;i<=N;i++){for(j=M;j>=weight[i];j--){if(f[j]<f[j-weight[i]]+vau[i])f[j]=f[j-weight[i]]+vau[i];}}printf("%d\n",f[M]);}return 0;}