HDU1260(KB12-H DP)

Tickets

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3917    Accepted Submission(s): 1968

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

 

Source

浙江工业大学第四届大学生程序设计竞赛

 

 //2017-04-04
 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>

 using namespace std;

 int s[], d[], dp[];//dp[i]表示前i个人所需要的最短时间
 //状态转移方程：dp[i] = min(dp[i-1]+s[i], dp[i-2]+d[i-1])

 int main()
 {
     int T, n;
     scanf("%d", &T);
     while(T--)
     {
         scanf("%d", &n);
         for(int i = ; i < n; i++)
               scanf("%d", &s[i]);
         for(int i = ; i < n-; i++)
               scanf("%d", &d[i]);
         dp[] = s[];
         dp[] = min(dp[]+s[], d[]);
         for(int i = ; i < n; i++)
               dp[i] = min(dp[i-]+s[i], dp[i-]+d[i-]);
         int h, m, s;
         h = +dp[n-]/;
         m = (dp[n-]%)/;
         s = dp[n-]%;
         if(h < )printf("%02d:%02d:%02d am\n", h, m, s);
         else printf("%02d:%02d:%02d pm\n", h, m, s);
     }

     return ;
 }