邮票 Stamps

https://www.luogu.org/problemnew/show/P2725

题解：DP+完全背包

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=2000000+10;
const int M=2000000;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
int a[N];
int dp[N];
char str;
struct node{};
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    //scanf("%d",&t);
    //while(t--){
    scanf("%d%d",&m,&n);
    for(int i=1;i<=M;i++)dp[i]=INF;
    dp[0]=0;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        for(int j=a[i];j<=M;j++){
            if(dp[j]>dp[j-a[i]]+1)
                dp[j]=dp[j-a[i]]+1;
        }
    }
    for(int i=1;i<=M;i++){
        if(dp[i]>m){
            ans=i-1;
            break;
        }
    }
    cout<<ans<<endl;
    //}

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}

标签：邮票,const,cout,int,Stamps,include,dp,define
来源： https://blog.csdn.net/weixin_43272781/article/details/90723594