算法竞赛入门经典(第二版) 第九章
以前写的代码太简单了。。。
#include<stdio.h>
#include<algorithm>
using namespace std;
#define MAXN 105
#define INF 10000000
int V[MAXN], Min[MAXN], Max[MAXN];
int n, S;
void print_ans(int *d, int S) {
for (int i = 1; i <= n; i++) {
if (S >= V[i] && d[S] == d[S - V[i]] + 1) {
printf("%d ", V[i]);
print_ans(d, S - V[i]);
break;
}
}
}
int main() {
scanf("%d%d", &n, &S);
for (int i = 1; i <= n; i++)
scanf("%d", &V[i]);
Min[0] = 0;
Max[0] = 0;
for (int i = 1; i <= S; i++) {
Min[i] = INF;
Max[i] = -INF;
}
for (int i = 1; i <= S; i++) {
for (int j = 1; j <= n; j++) {
if (i >= V[j]) {
Min[i] = min(Min[i], Min[i - V[j]] + 1);
Max[i] = max(Max[i], Max[i - V[j]] + 1);
}
}
}
printf("%d %d\n", Min[S], Max[S]);
print_ans(Min, S);
printf("\n");
print_ans(Max, S);
printf("\n");
return 0;
}