Tickets
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2694 Accepted Submission(s): 1308
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
2
2
20 25
40
1
8
Sample Output
08:00:40 am
08:00:08 am
设single个数据为one[i],double个数据为two[i];
状态转移方程为 dp[i] = min(dp[i-1]+one[i],dp[i-2]+two[i]);
1 #include<iostream> 2 #include<cstdio> 3 #include<algorithm> 4 #include<cstring> 5 using namespace std; 6 const int maxn = 2005; 7 int one[maxn],two[maxn]; 8 int dp[maxn]; 9 void solve(){ 10 int t; 11 scanf("%d",&t); 12 while(t--){ 13 int n; 14 scanf("%d",&n); 15 for(int i = 1; i<=n; i++) scanf("%d",&one[i]); 16 for(int i = 2;i<=n; i++) scanf("%d",&two[i]); 17 memset(dp,0,sizeof(dp)); 18 if(n == 1) dp[n] = one[1]; 19 else{ 20 dp[1] = one[1]; 21 for(int i = 2; i<=n; i++){ 22 dp[i] = min(dp[i-1]+one[i],dp[i-2]+two[i]); 23 } 24 } 25 int s = dp[n]; 26 int second,minute,hour; 27 second = s % 60; 28 minute = s / 60 % 60; 29 hour = s / 60 /60 % 60 + 8; 30 int flag = 0; 31 if(hour>12){ 32 flag = 1; 33 hour %= 12; 34 } 35 if(hour < 10) printf("0"); 36 printf("%d:",hour); 37 if(minute<10) printf("0"); 38 printf("%d:",minute); 39 if(second<10) printf("0"); 40 printf("%d ",second); 41 if(flag) printf("pm"); 42 else printf("am"); 43 printf(" "); 44 } 45 } 46 int main() 47 { 48 solve(); 49 return 0; 50 }