bzoj1578[Usaco2009 Feb]Stock Market 股票市场 完全背包

转化成完全背包以后直接做就可以了。
模型很好。

#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<cstdlib>#include<vector>#include<queue>#define inf 1000000000#define fo(i,a,b) for(int i=a;i<=b;i++)#define fd(i,a,b) for(int i=a;i>=b;i--)#define pa pair<int,int>using namespace std;int a[100][100];int f[5000005];int n,K,m;int main(){    scanf("%d%d%d",&n,&K,&m);    fo(i,1,n)    fo(j,1,K)scanf("%d",&a[i][j]);    fo(i,1,K-1)    {        memset(f,0,sizeof(f));        fo(j,1,n)        {            fo(k,a[j][i],m)            f[k]=max(f[k],f[k-a[j][i]]+a[j][i+1]-a[j][i]);        }        m+=f[m];    }    printf("%d\n",m);}