hdoj 2660 Accepted Necklace【DFS】
来源:互联网 发布:药代动力学考研知乎 编辑:程序博客网 时间:2024/05/16 11:44
Accepted Necklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3141 Accepted Submission(s): 1217
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<stdio.h>struct node{int v,w; }p[22]; int n,k,v,w,a,t,sum;void dfs(int v,int w,int z,int j)//4个参数 依次是 价值 重量 合格宝石数量 j控制时间已经搜索过的不再判断 {if(w > a|| z > k)return;//如果重量不符合或者合格个数超过限制--结束 if(sum < v)sum = v;//价值最高 for(int i = j; i < n;i++)dfs(v+p[i].v, w+p[i].w, z+1,i+1);}int main(){scanf("%d",&t);while(t--){sum = 0;scanf("%d%d",&n, &k);// n块宝石,其中 k 块可以做成项链 for(int i = 0; i < n; i++)scanf("%d%d",&p[i].v,&p[i].w);scanf("%d", &a );//项链重量限制 dfs(0,0,0,0);printf("%d\n",sum);}return 0;}
1 0
- hdoj 2660 Accepted Necklace【DFS】
- HDOJ(HDU).2660 Accepted Necklace (DFS)
- hdu 2660 Accepted Necklace DFS
- HDU 2660 Accepted Necklace (DFS)
- hdu 2660 Accepted Necklace(dfs、dp)
- hdu 2660 Accepted Necklace dp / dfs
- HDOJ Accepted Necklace
- HDU2660:Accepted Necklace(DFS)
- hdu2660 Accepted Necklace (DFS)
- HDU2660:Accepted Necklace(DFS)
- hdu2660(Accepted Necklace)-dfs
- HDOJ题目2660 Accepted Necklace(二维01背包)
- hdu 2660 Accepted Necklace(01-背包变形 || DFS)
- HDU 2660 Accepted Necklace(DFS解01背包)
- HDU 2660 Accepted Necklace (01背包,dfs)
- hdu 2660 Accepted Necklace
- Accepted Necklace 2660
- hdu-2660 Accepted Necklace
- vs2013+matlab 编译vlfeat 64位
- AE开发之路(一)
- hdoj 2680 Choose the best route 【dijkstra】
- windows访问linux samba共享目录用户名密码不对问题解决
- HDU 2066 一个人的旅行 <裸的迪杰斯特拉算法+虚拟顶点法>
- hdoj 2660 Accepted Necklace【DFS】
- App Store Review Guidelines
- 码农需要写作吗?
- Windows7根据pid查看到对应程序
- 安卓每日一记之在textview动态数据传入后加后面的固定数据
- 浅谈Java中的hashcode方法
- Ubuntu14.04 配置 iptables 把80端口转到8080
- webserver应该怎么去做?
- io(三)