（OJ百练4102）宠物小精灵之收服

题目描述

二维背包问题，实际上套一维背包及后续优化模板即可。。。

状态转移方程：
开个坑先。。。

代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
int n, m, k;
int ball[101] = { 0 }, hurt[101] = { 0 };
int dp[1010][505] = { 0 };

void findans() {
	int num = 0, life = m;
	dp[ball[0]][hurt[0]] = 1;
	for (int i = 1; i < k; ++i) {
		for (int j = n; j >= ball[i]; --j) {
			for (int k = m; k >= hurt[i]; --k) {
				dp[j][k] = max(dp[j][k], dp[j - ball[i]][k - hurt[i]] + 1);
				if (num == dp[j][k]) life = min(life, k);
				else {
					num = max(num, dp[j][k]);
					if (num == dp[j][k]) life = k;
				}
			}
		}
	}
	cout << num << ' ' << (num ? m - life : m) << endl;
}

int main(){
	cin >> n >> m >> k;
	for (int i = 0; i < k; ++i) cin >> ball[i] >> hurt[i];
	findans();
    return 0;
}

本文地址：https://blog.csdn.net/weixin_43532213/article/details/107325230