BZOJ 1578 DP

思路：裸的完全背包

//By SiriusRen#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int s,d,m,a[66][66],ans[55],f[555555];#define N 505000int main(){    scanf("%d%d%d",&s,&d,&m);    for(int i=1;i<=s;i++)        for(int j=1;j<=d;j++)            scanf("%d",&a[i][j]);    ans[1]=m;    for(int ii=2;ii<=d;ii++){        memset(f,0,sizeof(f));        int temp=0;        for(int i=0;i<=ans[ii-1];i++){            for(int j=1;j<=s;j++)                if(i-a[j][ii-1]>=0)f[i]=max(f[i-a[j][ii-1]]+a[j][ii],f[i]);            temp=max(temp,ans[ii-1]-i+f[i]);        }        ans[ii]=temp;    }    printf("%d\n",ans[d]);}