HDU-1260 Tickets ( DP )

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1260

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

 

DP水题 前i个人所用的时间只与前i-1人和前i-2人所用的时间有关，直接的结果。

 

 1 #include<iostream>
 2 #include<cstring>
 3 #include<algorithm>
 4 #include<cmath>
 5 using namespace std;
 6 
 7 int one[2005];
 8 int two[2005];
 9 int dp[2005];
10 
11 int main(){
12     ios::sync_with_stdio( false );
13 
14     int T, k;
15     cin >> T;
16     while( T-- ){
17         cin >> k;
18         for( int i = 0; i < k; i++ )
19             cin >> one[i];
20         for( int i = 0; i < k - 1; i++ )
21             cin >> two[i];
22 
23         dp[1] = one[0];
24         dp[2] = min( one[0] + one[1], two[0] );
25 
26         for( int i = 3; i <= k; i++ )
27             dp[i] = min( dp[i - 1] + one[i - 1], dp[i - 2] + two[i - 2] );
28 
29         int h = 8, m = 0, s = 0;
30         s = dp[k] % 60;
31         m = dp[k] / 60 % 60;
32         h += dp[k] / 60 / 60;
33 
34         if( h < 10 ) cout << "0" << h << ":";
35         else cout << h << ":";
36         if( m < 10 ) cout << "0" << m << ":";
37         else cout << m << ":";
38         if( s < 10 ) cout << "0" << s << " am\n";
39         else cout << s << " am\n";
40     }
41 
42     return 0;
43 }

 

转载于:https://www.cnblogs.com/hollowstory/p/5440655.html