Tickets

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：每个人有两个状态：1：前一个人单独买票了，自己单独买，2：前一个人要和自己一起买票

状态转移方程：

dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i-1]);

其中a为第i个人单独买票花费时间，b为i-1个人和第i个人一起买票时间

完整代码：

#include <iostream>
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
int n,t,i,a[3000],b[3000],dp[3000],s,m,h;
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=1;i<=n-1;i++)
        {
            scanf("%d",&b[i]);
        }
        dp[0]=0;
        dp[1]=a[1];
        for(i=2;i<=n;i++)
        {
            dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i-1]);
        }
        s=dp[n]%60;
        m=(dp[n]/60)%60;
        h=((dp[n]/3600)%60+8)%24;
        if(h==0)
            printf("%02d:%02d:%02d am\n",12,m,s);
        else if(h>0&&h<12)
            printf("%02d:%02d:%02d am\n",h,m,s);
        else if(h==12)
            printf("%02d:%02d:%02d pm\n",h,m,s);
        else
            printf("%02d:%02d:%02d pm\n",h%12,m,s);
    }
    return 0;
}