程序员人生网站导航

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

栏目：php教程时间：2015-04-10 07:54:43

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日 星期4 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⑴5;
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.
");
            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.
",  dp2[m], all);
    }
    return 0;
}

------分隔线----------------------------

上一篇 FAT格式磁盘镜像制作方法

下一篇 算法之选择排序

------分隔线----------------------------