【hdu 2660】Accepted Necklace 二维费用01背包
来源:互联网 发布:象神佛牌禁忌知多少 编辑:程序博客网 时间:2024/05/21 08:58
Accepted Necklace
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 12 Accepted Submission(s) : 8
Problem Description
I have N precious stones, and plan to use K of them to make a necklace for my mother, but she won't accept a necklace which is too heavy. Given the value and the weight of each precious stone, please help me find out the most valuable necklace my mother will accept.
Input
The first line of input is the number of cases.
For each case, the first line contains two integers N (N <= 20), the total number of stones, and K (K <= N), the exact number of stones to make a necklace.
Then N lines follow, each containing two integers: a (a<=1000), representing the value of each precious stone, and b (b<=1000), its weight.
The last line of each case contains an integer W, the maximum weight my mother will accept, W <= 1000.
For each case, the first line contains two integers N (N <= 20), the total number of stones, and K (K <= N), the exact number of stones to make a necklace.
Then N lines follow, each containing two integers: a (a<=1000), representing the value of each precious stone, and b (b<=1000), its weight.
The last line of each case contains an integer W, the maximum weight my mother will accept, W <= 1000.
Output
For each case, output the highest possible value of the necklace.
Sample Input
1 2 1 1 1 1 1 3
Sample Output
1
#include<cstdio>#include<cstring>#define max(a,b) (a)>(b)?(a):(b)int main(){ int T,N,K,W,i,j,k,val[25],wei[25],dp[1005][25]; scanf("%d",&T); while(T--) { scanf("%d%d",&N,&K); for(i=0;i<N;i++) scanf("%d%d",&val[i],&wei[i]); scanf("%d",&W); memset(dp,0,sizeof(dp)); for(i=0;i<N;i++) for(j=W;j>=wei[i];j--) for(k=1;k<=K;k++) dp[j][k]=max(dp[j-wei[i]][k-1]+val[i],dp[j][k]); printf("%d\n",dp[W][K]); }}
- 【hdu 2660】Accepted Necklace 二维费用01背包
- hdu 2660 Accepted Necklace (二维01背包)
- hdu 2660 Accepted Necklace (二维背包 简单题)
- HDOJ题目2660 Accepted Necklace(二维01背包)
- hdu2660 Accepted Necklace (二维背包)
- hdu2660 Accepted Necklace 二维背包
- hdu 2660 Accepted Necklace(01-背包变形 || DFS)
- HDU 2660 Accepted Necklace(DFS解01背包)
- HDU 2660 Accepted Necklace (01背包,dfs)
- 【DP】 HDU 2660 Accepted Necklace 限制背包
- hdu 2660 Accepted Necklace
- hdu-2660 Accepted Necklace
- hdu 2660 Accepted Necklace
- HDU 2660 Accepted Necklace
- HDU 2660 Accepted Necklace
- hdu 2660 Accepted Necklace
- HDU 2660 Accepted Necklace
- HDU 2660 Accepted Necklace
- struts全局结果集
- Solr 4.0: Realtime GET
- IP地址转换函数——inet_ntop(),inet_pton(),htonl(),ntohl()
- hdu1016 (素数环)(深度优先搜索)另附:http://acm.nyist.net/JudgeOnline/problem.php?pid=488
- ZOJ 3202 Second-price Auction
- 【hdu 2660】Accepted Necklace 二维费用01背包
- Socket编程中需要用到的头文件
- 【二分】划分数列
- n 个数中最小的 k 个数
- 三极管基础知识
- sicily--1930. 排序
- struts.xml详解
- jquery tabs使用最简化实例
- AIR3.4 & FlashPlayer11.4并发机制(ActionScript Workers)例子