HDU 1712 分組背包

http://www.nocow.cn/index.php/%E5%88%86%E7%BB%84%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98

#include<cstdio>#include<cmath>#include<iostream>#include<vector>using namespace std;const int maxn=110;int A[maxn][maxn];int dp[maxn];int main(){//freopen("in.txt","r",stdin);int n,m;while(scanf("%d%d",&n,&m)!=EOF){if(n==0&&m==0)break;for(int i=1;i<=n;i++){for(int j=1;j<=m;j++)scanf("%d",&A[i][j]);}memset(dp,0,sizeof(dp));for(int i=1;i<=n;i++){for(int j=m;j>0;j--){for(int k=1;j-k>=0;k++)dp[j]=max(dp[j],dp[j-k]+A[i][k]);}}printf("%d\n",dp[m]);}}