#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn = 10000005;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int V[maxn], d[maxn];
int n;
int dp(int S) {
int& ans = d[S];
if (ans != -1) return ans;
ans = -INF;
for (int i = 1; i <= n; i++) if (S >= V[i]) ans = max(ans, dp(S - V[i]) + 1);
return ans;
}
int main() {
int S;
scanf("%d",&n);
memset(d, -1, sizeof(d));
for (int i = 1; i <= n; i++) scanf("%d", &V[i]);
d[0] = 0;
while (scanf("%d", &S) != EOF)
printf("%d", dp(S));
}
硬币问题-动态规划 (ACM学习笔记)
最新推荐文章于 2022-06-24 12:37:59 发布