HDU 2660 Accepted Necklace(DFS解01背包)
来源:互联网 发布:用网络看电视直播 编辑:程序博客网 时间:2024/04/30 10:01
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.
Output
For each case, output the highest possible value of the necklace.
Sample Input
1
2 1
1 1
1 1
3
Sample Output
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.
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<iostream>#include<cstring>using namespace std;int maxn,n,k,weight;int vis[21];struct node{ int v,w;} a[21];void dfs(int v,int w,int n1,int k1){ if(w==weight||k1==k) { if(maxn<v) maxn=v; return; } for(int i=n1; i<n; i++) { if(!vis[i]&&w+a[i].w<=weight) { vis[i]=1; dfs(v+a[i].v,w+a[i].w,i+1,k1+1); vis[i]=0; } }}int main(){ int t; cin>>t; while(t--) { cin>>n>>k; for(int i=0; i<n; i++) cin>>a[i].v>>a[i].w; cin>>weight; memset(vis,0,sizeof(vis)); maxn=-1; dfs(0,0,0,0); cout<<maxn<<endl; }}背包解法:
#include<iostream>#include<cstring>using namespace std;int dp[1022][22];struct node{ int v,w;} a[21];int main(){ int t,i,j,z,n,k,w; cin>>t; while(t--) { cin>>n>>k; for(i=1;i<=n;i++) cin>>a[i].v>>a[i].w; cin>>w; memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++) for(j=w;j>=a[i].w;j--) for(z=1;z<=k;z++) dp[j][z]=max(dp[j][z],dp[j-a[i].w][z-1]+a[i].v); cout<<dp[w][k]<<endl; }}
0 0
- HDU 2660 Accepted Necklace(DFS解01背包)
- HDU 2660 Accepted Necklace (01背包,dfs)
- hdu 2660 Accepted Necklace(01-背包变形 || DFS)
- HDU 2660 Accepted Necklace (DFS)
- hdu 2660 Accepted Necklace(dfs、dp)
- hdu 2660 Accepted Necklace (二维01背包)
- hdu 2660 Accepted Necklace DFS
- 【hdu 2660】Accepted Necklace 二维费用01背包
- HDOJ(HDU).2660 Accepted Necklace (DFS)
- hdu 2660 Accepted Necklace dp / dfs
- 【DP】 HDU 2660 Accepted Necklace 限制背包
- HDOJ题目2660 Accepted Necklace(二维01背包)
- hdu 2660 Accepted Necklace
- hdu-2660 Accepted Necklace
- hdu 2660 Accepted Necklace
- HDU 2660 Accepted Necklace
- HDU 2660 Accepted Necklace
- hdu 2660 Accepted Necklace
- JavaScript基础——引用类型(二)日期类型Date、正则表达式类型RegExp
- OpenGLES---模型/观察/投影矩阵
- 如何转成libsvm支持的数据格式并做回归分析
- Android N Preview Notification API (通知)
- iOS8新特性扩展(Extension)应用之二——分享插件
- HDU 2660 Accepted Necklace(DFS解01背包)
- Ext.data.HttpProxy传参的中文乱码解决办法
- 【深入浅出Node.js系列十二】Nodejs日志管理log4js
- android 游戏 实战打飞机游戏 菜单页面(1)
- 一道关于信号的题
- httpModules 与 httpHandlers
- 深入理解计算机系统--->并发与并行
- Retrofit初体验,复杂数据gson解析
- 【深入浅出Node.js系列十三】用Nodejs连接MySQL