HDU 2660 Accepted Necklace(DFS解01背包)
2016-05-27 16:39
309 查看
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
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;
}
}
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;
}
}
相关文章推荐
- Win2003利用dfs(分布式文件系统)在负载均衡下的文件同步配置方案
- win2003分布式文件系统(dfs)配置方法[图文详解]
- win2003分布式文件系统及其部署 图文教程
- 简单的四则运算
- 数的奇偶性
- ACMer博客瀑布流分析
- ACM程序设计大赛题目分类
- 计算字符串最后一个单词长度
- Hadoop2.6+jdk8的安装部署(1)——使用jar包安装部署【详细】
- Hadoop FS Shell
- DFS使用方法总结
- ACM网址
- 1272 小希的迷宫
- 1272 小希的迷宫
- hdu 1250 大数相加并用数组储存
- FastDFS注意事项
- 无忧技术带您预览DFS(分布式文件系统)管理控制台
- 矩阵的乘法操作
- C 语言实现迷宫 DFS算法
- 蚂蚁爬行问题