HDOJ题目2660 Accepted Necklace(二维01背包)
来源:互联网 发布:unity3d喷泉粒子特效 编辑:程序博客网 时间:2024/05/18 00:56
Accepted Necklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2702 Accepted Submission(s): 1068
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
Source
HDU男生专场公开赛——赶在女生之前先过节(From WHU)
Recommend
zty | We have carefully selected several similar problems for you: 1035 1258 1312 1045 1241
ac代码
#include<stdio.h>#include<string.h>#define max(a,b) (a>b?a:b)int dp[1010][1010];int main(){int t;scanf("%d",&t);while(t--){int n,k,w[50],v[50],ii,i,j,m;memset(dp,0,sizeof(dp));scanf("%d%d",&n,&k);for(i=0;i<n;i++){scanf("%d%d",&v[i],&w[i]);}scanf("%d",&m);for(i=0;i<n;i++){for(j=m;j>=w[i];j--){for(ii=1;ii<=k;ii++){dp[j][ii]=max(dp[j][ii],dp[j-w[i]][ii-1]+v[i]);}}}printf("%d\n",dp[m][k]);}}
0 0
- HDOJ题目2660 Accepted Necklace(二维01背包)
- hdu 2660 Accepted Necklace (二维01背包)
- 【hdu 2660】Accepted Necklace 二维费用01背包
- hdu2660 Accepted Necklace (二维背包)
- hdu2660 Accepted Necklace 二维背包
- HDU 2660 Accepted Necklace(DFS解01背包)
- HDU 2660 Accepted Necklace (01背包,dfs)
- hdu 2660 Accepted Necklace (二维背包 简单题)
- hdoj 2660 Accepted Necklace【DFS】
- hdu 2660 Accepted Necklace(01-背包变形 || DFS)
- HDOJ(HDU).2660 Accepted Necklace (DFS)
- 【DP】 HDU 2660 Accepted Necklace 限制背包
- HDOJ Accepted Necklace
- HDU 2660 Accepted Necklace (DFS)
- hdu 2660 Accepted Necklace(dfs、dp)
- hdu 2660 Accepted Necklace
- Accepted Necklace 2660
- hdu-2660 Accepted Necklace
- LeetCode: Remove Duplicates from Sorted List
- 伪代码:括号匹配
- JAVA项目中发布WebService服务——简单实例
- 【Android】避免图片等资源泄露在系统图库当中
- Custom iphone cases gGgn rITx 7bizM
- HDOJ题目2660 Accepted Necklace(二维01背包)
- fut 14 coins Fa6F KleS cwOwi
- fifa coins R63p 5FJJ ImQNV
- ZipUtil
- PropertiesUtil
- 读Struts2深入详解第六章代码调试问题There is no Action mapped for namespace [/] and action name [register!default]
- 汉字转拼音工具类
- 2014湖南省大学生程序设计竞赛总结
- 数据库DQL语句