hdu2126---Buy the souvenirs(01背包方案数)

在冬季假期旅行中,人们会购买各种纪念品作为礼物或留作回忆。本文探讨了如何在有限预算下,通过算法计算出最优的纪念品组合方案,确保所选纪念品种类最多。通过实例分析不同金额下的最佳选择,本文为旅行者提供了一种高效决策的方法。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Problem Description
When the winter holiday comes, a lot of people will have a trip. Generally, there are a lot of souvenirs to sell, and sometimes the travelers will buy some ones with pleasure. Not only can they give the souvenirs to their friends and families as gifts, but also can the souvenirs leave them good recollections. All in all, the prices of souvenirs are not very dear, and the souvenirs are also very lovable and interesting. But the money the people have is under the control. They can’t buy a lot, but only a few. So after they admire all the souvenirs, they decide to buy some ones, and they have many combinations to select, but there are no two ones with the same kind in any combination. Now there is a blank written by the names and prices of the souvenirs, as a top coder all around the world, you should calculate how many selections you have, and any selection owns the most kinds of different souvenirs. For instance:

And you have only 7 RMB, this time you can select any combination with 3 kinds of souvenirs at most, so the selections of 3 kinds of souvenirs are ABC (6), ABD (7). But if you have 8 RMB, the selections with the most kinds of souvenirs are ABC (6), ABD (7), ACD (8), and if you have 10 RMB, there is only one selection with the most kinds of souvenirs to you: ABCD (10).

Input
For the first line, there is a T means the number cases, then T cases follow.
In each case, in the first line there are two integer n and m, n is the number of the souvenirs and m is the money you have. The second line contains n integers; each integer describes a kind of souvenir.
All the numbers and results are in the range of 32-signed integer, and 0<=m<=500, 0

/*************************************************************************
    > File Name: hdu2126.cpp
    > Author: ALex
    > Mail: zchao1995@gmail.com 
    > Created Time: 2015年03月05日 星期四 21时04分58秒
 ************************************************************************/

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

const double pi = acos(-1);
const int inf = 0x3f3f3f3f;
const double eps = 1e-15;
typedef long long LL;
typedef pair <int, int> PLL;

int dp[510];
int dp2[510];
int goods[35];


int main ()
{
    int t;
    int n, m;
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d%d", &n, &m);
        int all = 0;
        for (int i = 1; i <= n; ++i)
        {
            scanf("%d", &goods[i]);
        }
        int tmp = m;
        sort (goods + 1, goods + 1 + n);
        for (int i = 1; i <= n; ++i)
        {
            if (tmp >= goods[i])
            {
                ++all;
                tmp -= goods[i];
            }
            else
            {
                break;
            }
        }
        if (!all)
        {
            printf("Sorry, you can't buy anything.\n");
            continue;
        }
        memset (dp, 0, sizeof (dp));
        for (int i = 0; i <= m; ++i)
        {
            dp2[i] = 1;
        }
        for (int i = 1; i <= n; ++i)
        {
            for (int j = m; j >= goods[i]; --j)
            {
                if (dp[j] < dp[j - goods[i]] + 1)
                {
                    dp[j] = dp[j - goods[i]] + 1;
                    dp2[j] = dp2[j - goods[i]];
                }
                else if (dp[j] == dp[j - goods[i]] + 1)
                {
                    dp2[j] += dp2[j - goods[i]];
                }
            }
        }
        printf("You have %d selection(s) to buy with %d kind(s) of souvenirs.\n",  dp2[m], all);
    }
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值