捞(悬关)
  • 板块灌水区
  • 楼主Chiesl
  • 当前回复0
  • 已保存回复0
  • 发布时间2024/6/20 19:12
  • 上次更新2024/6/20 21:19:33
查看原帖
捞(悬关)
950799
Chiesl楼主2024/6/20 19:12

原帖

有木有神犇有时间帮忙看一下,蒟蒻写的这段代码能不能做解题程序?

#include<bits/stdc++.h>
using namespace std;
const int inf = 0x7f7f7f7f;
int n, t, E, d, S;
int f[1002][1002][2], p[1002], x[1002], ans, cnt;//f[i][j][0/1]分别表示第i时刻血量为j时是否喷气的最小花费
int main () {
	memset(f, 0x7f, sizeof(f));
	scanf("%d%d%d%d%d", &n, &t, &E, &d, &S), E -= d;
	for (int i = 1; i <= t; i++) scanf("%d", &p[i]);
	for (int i = 1; i <= t; i++) scanf("%d", &x[i]);
	f[0][n][0] = f[0][n][1] = 0;
	for (int i = 1; i <= t; i++) {
		for (int j = 1; j <= n; j++) {
			if (j + x[i] <= n) f[i][j][0] = min(f[i - 1][j + x[i]][0], f[i - 1][j + x[i]][1]);
			f[i][j][1] = min(f[i - 1][j][0] + S, f[i - 1][j][1]) + p[i];
			if (f[i][j][0] < inf || f[i][j][1] < inf) cnt = i;
		}
	}
	ans = inf;
	for (int i = 1; i <= n; i++) ans = min(ans, min(f[t][i][0], f[t][i][1]));
	if (ans < inf) printf("YES\n%d", ans);
	else printf("NO\n%d", cnt);
	return 0;
}
2024/6/20 19:12
加载中...