hduoj1260

Tickets

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

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
  
  
  
  

   
   题解：一开始没看懂题：第一个是数据组数，下面是人数n，下面2行，第一行是单个人等的时间；第二行是和前面的人合买的时间。
  
  
  
  

   
   状态转移方程：dp[i] = min(dp[i-1] + one[i],dp[i-2]+two[i]);
  
  
  
  

   
   很基础的一道dp
  
  
  
  

   
   代码：
  
  
  
  

   
   

    
    #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int  dp[10001],one[2222],two[2222];
int main(){
 int n,m;
 cin >> n;
 while(n--)
 {
  memset(dp,0,sizeof(dp));
  cin >> m;
  for(int i = 1;i <= m;i++) cin >> one[i];
  for(int i = 2;i <= m;i++) cin >> two[i];
  dp[1] = one[1];
  for(int i = 2;i <= m;i++)
  {
   dp[i] = min(dp[i-1] + one[i],dp[i-2]+two[i]);
  }
  int h = dp[m] / 3600+8;
  int min = dp[m]/60%60;
  int s = dp[m] %60;
  printf("%02d:%02d:%02d am\n", h, min, s);   
 }
   return 0;
   
   
   
   


   
   
   
   

    
    }