hdu 1260 Tickets 水题dp
来源:互联网 发布:软件无线电技术 编辑:程序博客网 时间:2024/06/15 00:59
Tickets
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4923 Accepted Submission(s): 2568
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.
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.
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
2220 254018
Sample Output
08:00:40 am08:00:08 am
Source
浙江工业大学第四届大学生程序设计竞赛
Recommend
JGShining
水dp:
时间是24时制
#include<stdio.h>#include<string.h>#include<algorithm>#define N 1000003#define inf 0x3f3f3f3fusing namespace std;int a[N];int b[N];int dp[N];int main(){ int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); for(int i=1; i<=n; i++) { scanf("%d",&a[i]); } b[1]=inf; for(int i=2; i<=n; i++) { scanf("%d",&b[i]); } dp[1]=a[1]; dp[0]=a[0]; for(int i=2; i<=n; i++) { dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i]); } int k=dp[n]; int h=(k/3600+8)%24; int m=k%3600/60; int s=k%3600%60; if(h<12) printf("%02d:%02d:%02d am\n", h, m, s); else printf("%02d:%02d:%02d pm\n", h, m, s); }}
阅读全文
0 0
- hdu 1260 Tickets 水题dp
- hdu 1260 Tickets 【dp】
- hdu 1260 Tickets(dp)
- hdu 1260 tickets dp
- hdu 1260 Tickets dp
- HDU - 1260 Tickets(DP)
- DP-HDU-1260-Tickets
- HDU 1260 Tickets (DP)
- hdu-1260 Tickets【dp】
- HDU-1260 Tickets(DP)
- HDU-1260-Tickets【DP】
- HDU 1260 Tickets 【dp】
- HDU 1260 Tickets(DP)
- [hdu 1260] Tickets [DP]
- HDU 1260 Tickets dp
- HDU 1260 Tickets(DP)
- HDU 1260 Tickets DP
- hdu 1260 Tickets(dp)
- Android Animation动画
- 字符串回文算法模板
- 02:奇数单增序列
- Java操作XML的五种方式之SAX
- SKYNET学习(一)
- hdu 1260 Tickets 水题dp
- 使用PUTTY的PSFTP上传文件到服务器
- springboot 的注解
- java.io.File返回值实验
- jQuery之设置元素内容(移动和复制元素,使用append(),appendTo()方法)
- corejava_01操作符,条件语句,循环语句,变量
- 语言小知识-python-lambda 的使用
- linux-文件搜索命令
- c# 闭包