AC

黑暗中的那颗星为你而闪耀 · 发布于 2025-07-26 · 浏览 324 回复 0

include <bits/stdc++.h>

using namespace std; int a[105], b[20010], d[20010]; const int M = 1e9;

int main() {

int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++)
	cin >> a[i];
for (int i = 0; i < n; i++)
	cin >> b[i];
for (int i = 0; i < n << 1; i++)
	d[i] = -M;
d[0] = 0;
for (int i = 0; i < n << 1; i++)
	for (int j = 0; j < m; j++)
		if (i >= a[j])
			d[i] = max(d[i], d[i - a[j]] + b[i - a[j]]);
int maxn = -M;
for (int i = n; i < n * 2; i++) 
	maxn = max(maxn, d[i]);	
cout << maxn;
return 0;

}

全部回复 共 0 条

还没有人回复。往下写第一条。

发表回复