P1802 5 倍经验日(DP)

最新推荐文章于 2024-10-09 22:28:58 发布

eva_can(not)survive

最新推荐文章于 2024-10-09 22:28:58 发布

阅读量38

点赞数

分类专栏：洛谷学习 DP 文章标签：算法

本文链接：https://blog.csdn.net/Ghostttttttiii/article/details/123642468

版权

动态规划博弈论数组最大值编程算法

关键词由CSDN通过智能技术生成

洛谷学习同时被 2 个专栏收录

202 篇文章 0 订阅

订阅专栏

71 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000005;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);


const int N = 1e3 + 5;
//const int NN = 1e9 + 5;
int n, x;
int lose[1005];
int win[1005];
int use[1005];
ll dp[N][N];

void solve() {
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= x; j++) {
			if (j < use[i]) {
				dp[i][j] = dp[i - 1][j] + lose[i];
			} else {
				dp[i][j] = max(dp[i - 1][j] + lose[i], dp[i - 1][j - use[i]] + win[i]);
			}
		}
	}
	printf("%lld", 5 * dp[n][x]);
}

int main() {
	scanf("%d %d", &n, &x);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d %d", lose + i, win + i, use + i);
	}
	solve();
	return 0;
}