洛谷P1717 钓鱼（多重背包）

题目链接

https://www.luogu.com.cn/problem/P1717

思路

在每一个地方都可以钓任意时间的鱼，但当钓鱼的时间长了之后能钓的鱼的数量就会变成负数，$n$最大为$25$，$h$最大为$16\times 60$，因此这是一个多重背包问题。
$d{p}_{i,j}$表示前$i$个池塘，时间限制为$j$时最多能钓多少鱼，则状态转移方程为：
不钓鱼：$d{p}_{i,j}=d{p}_{i-1,j-t_{i-1}}$
钓鱼$($$tmp$记录在第$i$个池塘能钓的鱼少了多少$)$：
$d{p}_{i,j}=max(d{p}_{i,j},d{p}_{i-1,j-t_i-k}+f_i\ast (k/5)+tmp)$

代码

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 30 + 5, M = 1e3 + 5;
const int inf = 0x3f3f3f3f3f3f3f3f;
int n, h;
int f[N], d[N], t[N], dp[N][M];
void solve()
{
	cin >> n >> h;
	h *= 60;
	for (int i = 1; i <= n; i++)
	{
		cin >> f[i];
	}
	for (int i = 1; i <= n; i++)
	{
		cin >> d[i];
	}
	for (int i = 1; i < n; i++)
	{
		cin >> t[i];
		t[i] *= 5;
	}
	for (int i = 1; i <= n; i++)
		for (int j = 0; j <= h; j++)
			dp[i][j] = -inf;

	dp[1][0] = 0;
	for (int i = 1; i <= n; i++ )
	{
		for (int j = h; j >= t[i - 1]; j--)
		{
			dp[i][j] = dp[i - 1][j - t[i - 1]];
			int tmp = 0;
			for (int k = 5; k <= j; k += 5)
			{
				if (j - t[i - 1] - k < 0) break;
				dp[i][j] = max(dp[i][j], dp[i - 1][j - t[i - 1] - k] + f[i] * (k / 5) - tmp);
				tmp += (k / 5) * d[i];
			}
		}
	}

	int ans = 0;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j <= h; j++)
		{
			ans = max(ans, dp[i][j]);
		}
	}
	cout << ans << endl;

}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int test = 1;
	// cin >> test;
	for (int i = 1; i <= test; i++)
	{
		solve();
	}
	return 0;
}