DAG模型——硬币问题

大体题意：

有n种硬币，面值分别为V1，V2，V3，,,VN每种都有无限多。给定非负整数S，可以选用多少个硬币，使得面值之和恰好为S？ 输出硬币数目的最小值和最大值

思路：

这是一个DAG模型，相当于从起点S出发 到终点0的最长路和最短路，每使用一个硬币Vj，状态就从i转移到了i-Vj

用dp[i]记录状态i 到终点0的最短/长路！

记忆化搜索的形式：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000 + 10;
const int inf = 0x3f3f3f3f;
int n,s;
int v[maxn];
int dp1[maxn],dp2[maxn];
int dfs_max(int k){
    if (k == 0)return 0;<span style="font-family:Comic Sans MS;">// 如果  状态直接等于0  那么不需要转移 直接返回0！！！</span>
    int& ans = dp1[k];
    if (ans != -1)return ans;
    ans = -inf;
    for (int i = 1; i <= n; ++i){
        if (v[i] <= k){
            ans = max(ans,dfs_max(k-v[i]) + 1);
        }
    }
    return ans;
}
int dfs_min(int k){
    if (k == 0)return 0;
    int& ans = dp2[k];
    if (ans != -1)return ans;
    ans = inf;
    for (int i = 1; i <= n; ++i){
        if (v[i] <= k){
            ans = min(ans,dfs_min(k-v[i]) + 1);
        }
    }
    return ans;
}
int main(){
    while(scanf("%d",&n) == 1){
        memset(dp1,-1,sizeof dp1);
        memset(dp2,-1,sizeof dp2);
        for (int i = 1; i <= n; ++i){
            scanf("%d",&v[i]);
        }
        scanf("%d",&s);
        printf("Max = %d,Min = %d\n",dfs_max(s),dfs_min(s));
    }
    return 0;
}

输出路径最长 和 最短：

void print(int s,int *path){
    for (int i = 1; i <= n; ++i){
        if (s >= v[i] && path[s] == path[s-v[i]] + 1){
            printf("%d ",v[i]);
            print(s-v[i],path);
            break;
        }
    }
}

dp1[0] = dp2[0] = 0;
scanf("%d",&s);
printf("Max = %d,Min = %d\n",dfs_max(s),dfs_min(s));
printf("the path of Max:\n");
print(s,dp1);
puts("");
printf("The path of Min:\n");
print(s,dp2);
puts("");

样例输出：

5
1 2 4 8 16
32
Max = 32,Min = 2
the path of Max:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
The path of Min:
16 16
5
1 2 4 8 16
31
Max = 31,Min = 5
the path of Max:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
The path of Min:
1 2 4 8 16

递推的形式求值 + 打印最长最短路：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000 + 10;
const int inf = 0x3f3f3f3f;
int n,s;
int v[maxn];
int dp1[maxn],dp2[maxn];
void print(int s,int *path){
    for (int i = 1; i <= n; ++i){
        if (s >= v[i] && path[s] == path[s-v[i]] + 1){
            printf("%d ",v[i]);
            print(s-v[i],path);
            break;
        }
    }
}
int main(){
    while(scanf("%d",&n) == 1){
        dp1[0] = dp2[0] = 0;

        for (int i = 1; i <= n; ++i){
            scanf("%d",&v[i]);
        }
        scanf("%d",&s);
        for (int i = 1; i <= s; ++i){
            dp1[i] = -inf;
        }
        for (int i = 1; i <= s; ++i){
            dp2[i] = inf;
        }
        for (int i = 1; i <= s; ++i){
            for (int j = 1; j <= n; ++j){
                if (i >= v[j]) {
                    dp1[i] = max(dp1[i],dp1[i-v[j]] + 1);
                    dp2[i] = min(dp2[i],dp2[i-v[j]] + 1);
                }
            }
        }

        printf("Max = %d,Min = %d\n",dp1[s],dp2[s]);
        printf("the path of Max:\n");
        print(s,dp1);
        puts("");
        printf("The path of Min:\n");
        print(s,dp2);
        puts("");
    }


    return 0;
}

空间换时间的打印方式：

 for (int i = 1; i <= s; ++i){
            for (int j = 1; j <= n; ++j){
                if (i >= v[j]) {
                    if (dp1[i] < dp1[i-v[j]] + 1){
                        dp1[i] = dp1[i-v[j]] + 1;
                        max_coin[i] = v[j];
                    }
                    if (dp2[i] > dp2[i-v[j]] + 1){
                        dp2[i] = dp2[i-v[j]] + 1;
                        min_coin[i] = v[j];
                    }
                }
            }
        }

void print(int s,int *path){
    while(s){
        printf("%d ",path[s]);
        s-=path[s];
    }
}

自己也要反复体会~