CD+uva+01背包(输出方案)
来源:互联网 发布:linux启动samba 编辑:程序博客网 时间:2024/05/23 14:31
CD
Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu
Description
CD
You have a long drive by car ahead. You have a tape recorder, but unfortunately your best music is on CDs. You need to have it on tapes so the problem to solve is: you have a tape N minutes long. How to choose tracks from CD to get most out of tape space and have as short unused space as possible.
Assumptions:
- number of tracks on the CD. does not exceed 20
- no track is longer than N minutes
- tracks do not repeat
- length of each track is expressed as an integer number
- N is also integer
Program should find the set of tracks which fills the tape best and print it in the same sequence as the tracks are stored on the CD
Input
Any number of lines. Each one contains value N, (after space) number of tracks and durations of the tracks. For example from first line in sample data: N=5, number of tracks=3, first track lasts for 1 minute, second one 3 minutes, next one 4 minutesOutput
Set of tracks (and durations) which are the correct solutions and string `` sum:" and sum of duration times.Sample Input
5 3 1 3 410 4 9 8 4 220 4 10 5 7 490 8 10 23 1 2 3 4 5 745 8 4 10 44 43 12 9 8 2
Sample Output
1 4 sum:58 2 sum:1010 5 4 sum:1910 23 1 2 3 4 5 7 sum:554 10 12 9 8 2 sum:45
解决方案:01背包模板,要输出方案,可以加vis[i][j]数组来标记容量为j的选第i件物品,或不选第i件物品。
code:
#include <iostream>#include<cstdio>#include<cstring>#include<stack>using namespace std;int dp[100000];int v[100000];bool vis[100][10000];int main(){ int M,n; while(~scanf("%d",&M)){ scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&v[i]); } memset(dp,0,sizeof(dp)); memset(vis,false,sizeof(vis)); for(int i=1;i<=n;i++){ for(int j=M;j>=v[i];j--){ if(dp[j]<dp[j-v[i]]+v[i]){ dp[j]=dp[j-v[i]]+v[i]; vis[i][j]=true;///选第i件物品 } else vis[i][j]=false;///不选第i件物品 } } int m=M; stack<int>S; for(int i=n;i>=1;i--){ if(vis[i][m]){ S.push(v[i]); m-=v[i]; } } while(!S.empty()){ printf("%d ",S.top()); S.pop(); } printf("sum:%d\n",dp[M]); } return 0;}
0 0
- CD+uva+01背包(输出方案)
- Uva-624 CD (需要输出方案的01背包)
- UVA 624 CD(01背包输出)
- UVA 624 CD (01背包求方案)
- UVA 题目624 CD(01背包输出路径啊)
- UVa 624 CD (01背包路径输出)
- UVA 624 CD 01背包 输出解
- UVA 264 CD (01背包+输出路径)
- UVa 624 CD(01背包 需要记录最优解的任一方案)
- uva 624 - CD(01背包)
- UVA 624 CD 01背包(DP)
- UVa 624 CD (DP 01背包)
- UVA 624 - CD(01背包)
- UVA - 624 CD (01背包)
- uva 624 CD (01背包)
- UVA 624 CD (01背包)
- uva 624 CD(01背包问题)输出最小字典序是个问题虽然题目不要求
- uva 624 CD (DP + DFS 输出方案)
- 黑客怒了:政府花930万美金仅做一款App
- 显示电池电量
- 浏览器中防止后退按钮之服务器端处理
- linux下安装nginx
- 日历之完整版
- CD+uva+01背包(输出方案)
- 实现webservice客户端后在tomcat下运行正常,部署到weblogic报错
- 江门南大支持你在新会创业
- AFNetworking 2.0 上传图片
- $(function() {
- maven deploy 的那些事
- Eclipse导入工程改工程名,改文件(类)名,改变量名---改名全集
- Xcode中下载的iOS XX Simulator的存放目录
- C#--如何在一个函数中返回两个值(包含数组的参数)