USACO Section 3.1 Score Inflation(完全背包)

完全背包。模版题，可以用滚动数组优化。

#include<cstdio>#include<algorithm>#include<cmath>#include<queue>#include<cstring>#include<iostream>using namespace std;typedef long long LL;/*ID: kkkwjx1PROG: inflateLANG: C++*/const int maxn=10005;int dp[maxn];int w[maxn],v[maxn];int main(){    freopen("inflate.in","r",stdin);    freopen("inflate.out","w",stdout);    int n,m;    scanf("%d%d",&m,&n);    for(int i=1; i<=n; ++i)        scanf("%d%d",&w[i],&v[i]);    for(int i=1; i<=n; ++i)    {        for(int j=0; j<=m; ++j)            if(j>=v[i])                dp[j]=max(dp[j],dp[j-v[i]]+w[i]);    }    printf("%d\n",dp[m]);    return 0;}