UVA 624(记录路径)
来源:互联网 发布:手机测长度软件 编辑:程序博客网 时间:2024/06/06 08:27
/*You have a long drive by car ahead. You have a tape recorder, but unfortunately your best music is onCDs. You need to have it on tapes so the problem to solve is: you have a tape N minutes long. Howto 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 integerProgram should find the set of tracks which fills the tape best and print it in the same sequence asthe tracks are stored on the CDInputAny number of lines. Each one contains value N, (after space) number of tracks and durations of thetracks. For example from first line in sample data: N = 5, number of tracks=3, first track lasts for 1minute, second one 3 minutes, next one 4 minutesOutputSet of tracks (and durations) which are the correct solutions and string ‘sum:’ and sum of durationtimes.Sample Input5 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 2Sample Output1 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*/#include <stdio.h>#include <string.h>int main(){int n,t,i,j;int stack[105],top;int dp[105],time[105],flag[105][105];while(scanf("%d%d",&n,&t)!=EOF){memset(dp,0,sizeof(dp));memset(flag,0,sizeof(flag));for(i=0;i<t;i++)scanf("%d",&time[i]);for(i=0;i<t;i++){for(j=n;j>=time[i];j--){if(dp[j]<=dp[j-time[i]]+time[i]){flag[i][j]=1;dp[j]=dp[j-time[i]]+time[i];}}}i=t-1;j=dp[n];top=0;while(i>=0){if(flag[i][j]){stack[top++]=i;j-=time[i];}i--;}while(top>0){printf("%d ",time[stack[--top]]);}/*for(i=0;i<t,j>0;i++){if(flag[i][j]==1){printf("%d ",time[i]);j-=time[i];}}*/printf("sum:%d\n",dp[n]);}return 0;}
0 0
- UVA 624(记录路径)
- uva 624 CD(记录路径)
- UVA-624 记录路径dp
- UVA 624 CD(01背包+记录路径)
- UVA 624 CD(01背包/记录路径)
- CD - UVa 624 01背包记录路径
- 【DP】UVA 624 CD 记录路径
- 【uva】624 CD【背包记录路径】
- UVa - 624 - CD(0-1 + 记录路径)
- uva 01背包记录路径
- UVA 624 CD 【记录路径式的01背包】
- Uva 10400 Game Show Math (DP+记录路径)
- uva 10599- Robots(II) LIS记录路径
- Uva 10599 - Robots(II) (dp + 记录路径)
- UVA - 10599(求LIS,记录路径数)
- uva 624 (01背包打印路径)
- uva 11374 最短路+记录路径 dijkstra最短路模板
- UVA 624 CD (记录背包)
- Red Hat Enterprise Linux 7.0 安装方法
- 排序算法(冒泡 插入 快速 归并)java
- IOS-百度地图API用点生成线路、导航、自定义标注 2013年11月更新
- Java动态代理
- Mysql 基础语法
- UVA 624(记录路径)
- Http请求的
- Android 判断应用是否在前台
- DT大数据梦工厂Spark定制班笔记(010)
- BZOJ 3224 TYVJ 1728 普通平衡树
- 每日自动签到工具的制作思路
- js获得项目根路径
- 局部特征用于图像检索 Aggregating local features for Image Retrieval
- 网络编程read, write, recv, send函数返回值