HDU【1260】Tickets
来源:互联网 发布:c语言 函数式编程 编辑:程序博客网 时间:2024/06/05 00:13
Tickets
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2434 Accepted Submission(s): 1191
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 | We have carefully selected several similar problems for you: 1257 1160 1074 1159 1114
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 2005;int a[maxn],b[maxn],dp[maxn];//dp[i]表示前i个人买票所需要的最少时间int main(){ int T,n; scanf("%d",&T); while( T-- ) { scanf("%d",&n); for(int i = 1; i <= n; i++) scanf("%d",&a[i]); for(int i = 2; i <= n; i++) scanf("%d",&b[i]); dp[0] = 0; dp[1] = a[1]; for(int i = 2; i <= n; i++) dp[i] = min(dp[i-1]+a[i] , dp[i-2]+b[i]); int h,m,s; h = dp[n]/3600 + 8; m = dp[n]%3600/60; s = dp[n]%3600%60; if(h < 12) printf("%02d:%02d%:%02d am\n",h,m,s); else printf("%02d:%02d%:%02d pm\n",h,m,s); } return 0;}
0 0
- 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
- HDU 1260 Tickets
- HDU 1260 Tickets
- HDU - 1260 Tickets(DP)
- DP-HDU-1260-Tickets
- HDU 1260 Tickets
- HDU 1260 Tickets
- Java - 正则表达式 - Pattern - Matcher
- tomcat 启动报 找不到 StrutsPrepareAndExecuteFilter
- 解读——OpenCV Tutorials - Best of - Into Robotics
- Linux中一些基础命令,随用随记~
- Using TCP keepalive with Go
- HDU【1260】Tickets
- android应用程序---短信发送器
- STL源码剖析--概述
- Python + Graphviz 绘制神经网络结构图
- 数据库术语
- 第四周项目五 求两个数最大公约数
- R语言 一元线性回归
- 自动化测试,HttpClient调用Rest服务
- golang tcp heartbeat