HDU 1260 Tickets
2017-08-11 19:09
169 查看
HDU 1260 Tickets
Time limit 1000 msMemory limit 32768 kB
OS Windows
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
Submit
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> using namespace std; #define maxn 2010 #define INF 0x3f3f3f3f int n[maxn], a[maxn]; int dp[maxn]; int main() { int T; int h, m, s; scanf("%d", &T); while(T--) { int N; scanf("%d", &N); dp[0] = 0; for(int i = 1; i <= N; i++) { scanf("%d", &a[i]); } memset(n, INF, sizeof(n)); for(int i = 2; i <= N; i++) scanf("%d", &n[i]); dp[1] = a[1]; for(int i = 2; i <= N; i++) dp[i] = min(dp[i-1]+a[i], dp[i-2]+n[i]);//一次买1张或1次买2张 s = dp ; h = s / 3600; s %= 3600; m = s / 60; s %= 60; h += 8; h %= 24; if(h <= 12) printf("%02d:%02d:%02d am\n", h, m, s); else printf("%02d:%02d:%02d pm\n", h, m, s); } return 0; }
相关文章推荐
- HDU 1260 Tickets (动规)
- HDU 1260 Tickets
- hdu 1260 Tickets 水题dp
- HDU 1260 Tickets(简单dp)
- hdu 1260 Tickets 动态规划
- HDU 1260 Tickets 简单DP
- HDU 1260 - Tickets
- HDU 1260 Tickets
- [dp专题]hdu 1260 tickets
- 每日三题-Day3-B(HDU 1260 Tickets 基础DP)
- hdu 1260 Tickets(DP)
- hdu 1260 Tickets(DP)
- hdu 1260 Tickets
- HDU 1260 Tickets
- HDU 1260 Tickets(DP OR 记忆化搜索)
- hdu 1260 Tickets(DP)
- 动态规划 hdu 1260 Tickets
- hdu 1260 Tickets
- HDU 1260 Tickets
- hdu 1260 Tickets(DP)