hdu 1712 分组背包入门

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 using namespace std;
 5 
 6 const int INF = -99999999;
 7 const int N = 101;
 8 int a[N][N];
 9 int dp[N];
10 int n, m;
11 
12 int main ()
13 {
14     while ( scanf("%d%d", &n, &m) != EOF )
15     {
16         if ( n == 0 && m == 0 ) break;
17         for ( int i = 1; i <= n; i++ )
18         {
19             for ( int j = 1; j <= m; j++ )
20             {
21                 scanf("%d", &a[i][j]);
22             }
23         }
24         memset( dp, 0, sizeof(dp) );
25         for ( int i = 1; i <= n; i++ )
26         {
27             for ( int j = m; j > 0; j-- )
28             {
29                 for ( int k = 1; k <= j; k++ )
30                 {
31                     dp[j] = max( dp[j], dp[j - k] + a[i][k] );
32                 }
33             }
34         }
35         printf("%d\n", dp[m]);
36     }
37     return 0;
38 }