HDU2660:Accepted Necklace(DFS)
来源:互联网 发布:门店数据分析 编辑:程序博客网 时间:2024/06/04 19:50
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题意:给出宝石的数目n,制成项链所需的宝石个数k,然后再给出每个宝石的价值与重量,还有母亲会接受的最大价值,求出在最大价值范围内,项链的价值尽可能大。思路:这一次用dfs做了,等掌握了二维费用背包之后再尝试用背包去做#include <stdio.h>#include <string.h>struct node{ int v,w;}p[50];int maxn,n,k,weight,vis[50];void dfs(int wei,int val,int step,int sum){ if(sum == k || wei == weight) { if(maxn<val) maxn = val; return ; } for(int i = step;i<=n;i++) { if(!vis[i] && sum+1<=k && wei+p[i].w<=weight) { vis[i] = 1; dfs(wei+p[i].w,val+p[i].v,i+1,sum+1); vis[i] = 0; } } return ;}int main(){ int t,i,j; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&k); for(i = 1;i<=n;i++) { scanf("%d%d",&p[i].v,&p[i].w); vis[i] = 0; } scanf("%d",&weight); maxn = 0; dfs(0,0,0,0); printf("%d\n",maxn); } return 0;}
- HDU2660:Accepted Necklace(DFS)
- hdu2660 Accepted Necklace (DFS)
- HDU2660:Accepted Necklace(DFS)
- hdu2660(Accepted Necklace)-dfs
- HDU2660 Accepted Necklace
- ACM-DFS之Accepted Necklace——hdu2660
- hdu2660 Accepted Necklace (二维背包)
- hdu2660 Accepted Necklace 二维背包
- hdu2660——Accepted Necklace
- hdoj 2660 Accepted Necklace【DFS】
- hdu 2660 Accepted Necklace DFS
- HDU 2660 Accepted Necklace (DFS)
- hdu 2660 Accepted Necklace(dfs、dp)
- HDOJ(HDU).2660 Accepted Necklace (DFS)
- hdu 2660 Accepted Necklace dp / dfs
- hdu2660(dfs)
- Accepted Necklace
- hdu 2660 Accepted Necklace(01-背包变形 || DFS)
- ASP.NET MVC案例教程(基于ASP.NET MVC beta)——第一篇:准备工作
- 百度地图查询视野范围内的建筑物
- 数组al[0,mid-1]和al[mid,num-1]是各自有序的,对数组al[0,num-1]的两个子有序段进行merge,得到al[0,num-1]整体有序
- ASP.NET MVC案例教程(基于ASP.NET MVC beta)——第二篇:第一个页面
- Android 升级ADT后,NoClassDefFoundError问题解决
- HDU2660:Accepted Necklace(DFS)
- Mutex::AutoLock介绍
- ASP.NET MVC案例教程(基于ASP.NET MVC beta)——第三篇:ASP.NET MVC全局观
- 素数 高效率找到i到n之间的素数
- 贝叶斯分类(下)
- 以无法为有法 以无限为有限
- 自定义Cell的用法
- ASP.NET MVC案例教程(基于ASP.NET MVC beta)——第四篇:传递表单数据
- 深入了解“网上邻居”原理