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

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int f[1000001],c[100001],w[100001];int main(){        int  i,j,v,n;        while(scanf("%d%d",&n,&v)!=EOF)        {             memset(f,0,sizeof(f));            for (i=1;i<=n;i++)            scanf("%d%d",&c[i],&w[i]);            for (i=1;i<=n;i++)            {                for (j=v;j>=c[i];j--)                {                    f[j]=max(f[j],f[j-c[i]]+w[i]);     // f数组空间一定要开大点就败在这上面啦，可能是因为该数组要多次循环所以空间要大点                }            }        }        printf("%d\n",f[v]);    return 0;}