USACO Training Section 3.1 Score Inflation

英文原题  中文题译

简单的0-1背包问题。与装箱问题不同，后者是NP-hard的。

/*
ID: blackco3
TASK: inflate
LANG: C++
*/
#include <iostream>
#include <memory.h>
using namespace std;
#define _max_time_ 10001

int main() {
	freopen("inflate.in", "r", stdin);
	freopen("inflate.out", "w", stdout);
    int t_limit, n_item ;
    cin >> t_limit >> n_item ;
	int dp[_max_time_];
    memset( dp, 0, sizeof(dp) );
	for (int i=0; i<n_item; i++ ) {
        int time, score ;
		cin >> score >> time;
        for (int t=time; t<=t_limit; t++)
			dp[t] = dp[t] > dp[t-time]+score ? dp[t] : dp[t-time] + score ;
    }
    cout << dp[t_limit] << endl ;
	return 0;
}