hdu 1712

ACboy needs your help

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4684    Accepted Submission(s): 2514

Problem Description

ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrange the M days for the N courses to maximize the profit?

 

Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers N and M, N is the number of courses, M is the days ACboy has.
Next follow a matrix A[i][j], (1<=i<=N<=100,1<=j<=M<=100).A[i][j] indicates if ACboy spend j days on ith course he will get profit of value A[i][j].
N = 0 and M = 0 ends the input.

 

Output

For each data set, your program should output a line which contains the number of the max profit ACboy will gain.

 

Sample Input

  
  

   
   2 2
1 2
1 3
2 2
2 1
2 1
2 3
3 2 1
3 2 1
0 0
  
  

 

Sample Output

  
  

   
   3
4
6
  
  

 

Source

HDU 2007-Spring Programming Contest

 

开始还以为是泛化物品 后来才知道是 分组背包 直接套 背包九讲的公式

好像大多数流传的背包九讲里面的分组背包都是错的

#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cstdio>
#include <vector>
#include <string>
#include <iterator>
#include <cmath>
#include <deque>
#include <stack>
#include <cctype>
using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 110;
const int INF = 0xfffffff;
const double eps = 1e-8;
const ll MOD = 1e9 + 7;

#define INFL 0x7fffffffffffffffLL
#define met(a, b) memset(a, b, sizeof(a))
#define rep(c, a, b) for (ll c = a; c < b; c++)
#define nre(c, a, b) for (int c = a; c > b; c--)

int a[N][N], dp[N];

int main ()
{
    int m, n;
    while (cin >> n >> m, m + n)
    {
        met (a, 0); met (dp, 0);
        rep (i, 1, n+1) rep (j, 1, m+1) cin >> a[i][j];

        rep (i, 1, n+1) {
            nre (j, m, -1) {  //体积必须是外循环
                rep (k, 1, j+1) {
                    dp[j] = max (dp[j], dp[j-k] + a[i][k]);
                }
            }
        }
        cout << dp[m] << endl;
    }
    return 0;
}