【HDU 杭电 1260 Tickets】
来源:互联网 发布:ug nx软件 编辑:程序博客网 时间:2024/06/07 07:13
Tickets
Problem Description
Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as possible.
A good approach, reducing the total time of tickets selling, is let adjacent people buy tickets together. As the restriction of the Ticket Seller Machine, Joe can sell a single ticket or two adjacent tickets at a time.
Since you are the great JESUS, you know exactly how much time needed for every person to buy a single ticket or two tickets for him/her. Could you so kind to tell poor Joe at what time could he go back home as early as possible? If so, I guess Joe would full of appreciation for your help.
Input
There are N(1<=N<=10) different scenarios, each scenario consists of 3 lines:
1) An integer K(1<=K<=2000) representing the total number of people;
2) K integer numbers(0s<=Si<=25s) representing the time consumed to buy a ticket for each person;
3) (K-1) integer numbers(0s<=Di<=50s) representing the time needed for two adjacent people to buy two tickets together.
Output
For every scenario, please tell Joe at what time could he go back home as early as possible. Every day Joe started his work at 08:00:00 am. The format of time is HH:MM:SS am|pm.
Sample Input
2
2
20 25
40
1
8
Sample Output
08:00:40 am
08:00:08 am
#include<queue>#include<stack>#include<cmath>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#define K 100011#define INF 0x3f3f3fusing namespace std;int pa[2011];//单独卖 int st[2011];//两个一起卖 int mp[2011];//当前最优解 int main(){ int i,j; int n; int k; int h;//小时 int m;//分钟 int s;//秒 scanf("%d",&n); while(n--) { scanf("%d",&k); for(i=1;i<=k;i++) scanf("%d",&pa[i]); for(i=2;i<=k;i++) scanf("%d",&st[i]); mp[0]=0; mp[1]=pa[1]; for(i=2;i<=k;i++) mp[i]=min(pa[i]+mp[i-1],mp[i-2]+st[i]);//当前的最优解 h=mp[k]/3600; mp[k]%=3600; m=mp[k]/60; mp[k]%=60; s=mp[k]; if(h+8>24) h=h+8-24; if(h+8>12&&h+8<=24) printf("%02d:%02d:%02d pm\n",h+8,m,s); else printf("%02d:%02d:%02d am\n",h+8,m,s); } return 0;}
- 【HDU 杭电 1260 Tickets】
- 【杭电1260】Tickets
- 杭电-1260 Tickets
- 杭电1260 Tickets
- 杭电1260 Tickets 动态规划
- 杭电ACM HDU 3105 Fred's Lotto Tickets
- hdu 1260 Tickets
- hdu 1260 Tickets
- HDU 1260 Tickets
- hdu 1260 Tickets
- hdu 1260 Tickets
- hdu 1260 Tickets
- hdu 1260 Tickets 【dp】
- hdu—1260:Tickets
- hdu 1260 Tickets(dp)
- hdu 1260 tickets dp
- HDU 1260 Tickets
- hdu 1260 Tickets dp
- POJ2559 单调队列
- java编程思想 bruce Eckel chapter2一切都是对象
- UVA-705 Slash Maze
- 添加bitcode的支持:iOS App,App Extension以及Watch App
- hdoj2059龟兔赛跑(DP)
- 【HDU 杭电 1260 Tickets】
- AngularJS之表达式
- UVA-439 Knight Moves
- java通过JDBC获取MySQL的数据实现
- VNC服务器空间不足:shell脚本检查回收站大小,提示清理
- 记录 boost 中 使用 asio 编写 server和client代码片段
- image.xx.com 通过haproxy 跳转到内部图片服务器
- SVN
- centos7端口操作