PAT甲级 1068 Find More Coins(30) (DP+背包路径)

最新推荐文章于 2024-05-23 20:47:46 发布

NHS6671

最新推荐文章于 2024-05-23 20:47:46 发布

阅读量152

点赞数

分类专栏： PAT-甲级文章标签：动态规划算法 pat考试职场和发展数据结构

本文链接：https://blog.csdn.net/NHS6671/article/details/125263147

版权

PAT-甲级专栏收录该内容

70 篇文章 0 订阅

订阅专栏

题目

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she must pay the exact amount. Since she has as many as $10^{4}$ coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find some coins to pay for it.

输入

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (≤ $10^{4}$ , the total number of coins) and M (≤ $10^{2}$ , the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers. All the numbers in a line are separated by a space.

输出

For each test case, print in one line the face values $V_{1}$ ≤ $V_{2}$ ≤⋯≤ $V_{K}$ such that $V_{1}$ + $V_{2}$ +⋯+ $V_{K}$ =M. All the numbers must be separated by a space, and there must be no extra space at the end of the line. If such a solution is not unique, output the smallest sequence. If there is no solution, output "No Solution" instead.

Note: sequence {A[1], A[2], ...} is said to be "smaller" than sequence {B[1], B[2], ...} if there exists k≥1 such that A[i]=B[i] for all i<k, and A[k] < B[k].

样例输入

样例输入1:

8 9
5 9 8 7 2 3 4 1
样例输入2:

4 8
7 2 4 3

样例输出

样例输出1:

1 3 5
样例输出2:

No Solution

题意理解

给你一些硬币的价值看这些硬币能不能凑到m的价值

用了经典的背包

我们用二维记录路径如果单单一维的话很难记录路径

如果凑不出来m的价值的话输出No Solution

要注意的是我们最后输出的是字典序最小的那个方案也就是多个方案的情况下

那么我们将所有硬币价值排个序最后输出的就是字典序最小的那个方案了

我们从后往前推过来

如果我的后一个状态等于我前一个状态的总值+这个硬币的价值

说明我就是从上一个状态加了这个硬币以后变到了现在这个状态

也就是

从后往前 i 是后面的状态 i-1是前面的状态 ans是我当前装的总价值

$f[i][ans]==f[i-1][ans-v[i]]+v[i]$

只要满足那么我这个硬币就是已经拿掉了所以我把这个硬币的价值减去

边减去价值边记录我拿的硬币的价值是多少最后输出

由于我们前面已经排好序了那么我们输出的一定是最小的字典序而且我们是从后往前的去找硬币的

代码

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10,M=1e2+10;
int f[N][M];
int n,m;
int v[N];
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        scanf("%d",&v[i]);
    }
    sort(v+1,v+1+n,greater<int>());
    for(int i=1;i<=n;i++){
        for(int j=0;j<=m;j++){
            f[i][j]=f[i-1][j];
            if (j>=v[i])f[i][j]=max(f[i][j],f[i-1][j-v[i]]+v[i]);
        }
    }
    if(f[n][m]!=m){
        puts("No Solution");
        return 0;
    }
    else {
        int ans=m;
        vector<int>ve;
        for(int i=n;i>=1;i--){
            if(ans>0&&f[i][ans]==f[i-1][ans-v[i]]+v[i]){
                ans-=v[i];
                ve.push_back(v[i]);
            }
        }
        for(int i=0;i<ve.size();i++){
            if(i)printf(" ");
            printf("%d",ve[i]);
        }
        puts("");
    }
    return 0;
}