hdu 1712 DP

分组背包.....第一道分组背包....而且是在快半夜两点的时候.....

AC代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

inline int max( int a, int b ){
	return ( a > b ? a : b );
}

int main(){
	int N, M;
	int v[101][101];
	int dp[101];
	while( scanf( "%d%d", &N, &M ) && !( N == 0 && M == 0 ) ){
		memset( v, 0, sizeof( v ) );
		for( int i = 1; i <= N; i++ ){
			for( int j = 1; j <= M; j++ ){
				cin >> v[i][j];
			}
		}
		memset( dp, 0, sizeof( dp ) );
		for( int i = 1; i <= N; i++ ){
			for( int j = M; j >= 0; j-- ){
				for( int k = j; k >= 0; k-- ){
					dp[j] = max( dp[j], dp[j-k] + v[i][k] );
				}
			}
		}
		cout << dp[M] << endl;
	}
}