HDU-2126 Buy the souvenirs (记录最优方案数的01背包问题 入门题)
来源:互联网 发布:ibm大数据学院 编辑:程序博客网 时间:2024/03/29 14:06
Buy the souvenirs
Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2531 Accepted Submission(s): 983
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).
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<n<=30, t<=500, and the prices are all positive integers. There is a blank line between two cases.
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<n<=30, t<=500, and the prices are all positive integers. There is a blank line between two cases.
Output
If you can buy some souvenirs, you should print the result with the same formation as “You have S selection(s) to buy with K kind(s) of souvenirs”, where the K means the most kinds of souvenirs you can buy, and S means the numbers of the combinations you can buy with the K kinds of souvenirs combination. But sometimes you can buy nothing, so you must print the result “Sorry, you can't buy anything.”
Sample Input
24 71 2 3 44 01 2 3 4
Sample Output
You have 2 selection(s) to buy with 3 kind(s) of souvenirs.Sorry, you can't buy anything.
#include <bits/stdc++.h>using namespace std;int dp[15001][31];int main(){ int T; scanf("%d", &T); while(T--){ int n, m, x, flag = 1; scanf("%d %d", &n, &m); memset(dp, 0, sizeof(dp)); for(int i = 0; i <= m; ++i){ dp[i][0] = 1; } for(int i = 1; i <= n; ++i){ scanf("%d", &x); for(int j = m; j >= x; --j){ for(int k = i; k >= 1; --k){ dp[j][k] = dp[j - x][k - 1] + dp[j][k]; } } } for(int i = n; i >= 1; --i){ if(dp[m][i] > 0){ printf("You have %d selection(s) to buy with %d kind(s) of souvenirs.\n", dp[m][i], i); flag = 0; break; } } if(flag){ printf("Sorry, you can't buy anything.\n"); } }}/*题意:给一些整数和一个上限,问最多可以选多少个数且和不超过上限,有多少种取法可以取到这么多数。思路:如果不考虑有多少方法,可以设dp[i]表示上限为i时最多可以选多少个数。但是现在还需要求有多少种取法,我们不妨加一维状态,dp[i][j]表示上限为i且取j个数有多少种取法。转移方程为:dp[j][k] = dp[j - x][k - 1] + dp[j][k]。要么选x,要么不选x。*/
阅读全文
0 0
- HDU-2126 Buy the souvenirs (记录最优方案数的01背包问题 入门题)
- HDU 2126 Buy the souvenirs 01背包 输出方案数
- hdu 2126 Buy the souvenirs(求方案数的背包)
- hdu 2126 Buy the souvenirs(求方案数的背包)
- hdu 2126 Buy the souvenirs (01背包输出方案数)
- Buy the souvenirs(方案数+01背包)
- Hdu 2162 Buy the souvenirs(一个求最优解总数的01背包题)
- hdu 2126 Buy the souvenirs(求方案数)
- HDU 2126 - Buy the souvenirs(01背包)
- hdu 2126 Buy the souvenirs 01背包
- hdu2126---Buy the souvenirs(01背包方案数)
- 【01背包方案数】HDU2126-Buy the souvenirs
- HDU 2126 Buy the souvenirs (01背包)
- HDU 2126 Buy the souvenirs (贪心&0-1背包最优解的个数)
- hdu 2126 Buy the souvenirs(01背包求最大容量方法数)
- NYOJ 2126 Buy souvenirs(01背包+输出方案数)
- Buy the souvenirs - HDU 2126 背包dp
- HDU 2126 Buy the souvenirs (dp 二维01背包)
- Spring的事务隔离级别和事务传播特性
- Git和SVN和Github
- pomelo(四) tutorial1 分布式聊天
- POJ2115 C Looooops
- Cause:org.springframework.beans.factory.NoUniqueBeanDefinitionException
- HDU-2126 Buy the souvenirs (记录最优方案数的01背包问题 入门题)
- config
- Java
- 大话设计模式之2策略模式-java代码
- 开发某个APP用到的开源框架
- mysql 单机多实例(二)
- Android蜘蛛网图/雷达图
- mysql索引
- springboot scheduled 异步执行