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
思想:由递推思想我们可知:最后的时间 = min( 前面算出的时间加上当前的时间 , 前面的前面的时间加上前一个人与当前的人一起买票的时间 )(的较小值)。额,,,用式子表示就是:f(n)=min( f(n-1)+a[n],f(n-2)+t[n-1])。a[ i ]表示单人消耗的时间,t[ i ] 表示相邻的两个人一起买票花费的时间。
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int n,a[2010],t[2010],d[2010];
int dp(){
int i,j;
d[0]=a[0];
d[1]=min(a[0]+a[1],t[0]);
for(i=2;i<n;i++){
d[i]=min(d[i-1]+a[i],d[i-2]+t[i-1]);
}
return d[n-1];
}
int main(){
int T;
cin>>T;
while(T--){
int i;
memset(a,0,sizeof(a));
memset(d,0,sizeof(d));
memset(t,0,sizeof(t));
cin>>n;
for(i=0;i<n;i++) cin>>a[i];
for(i=0;i<n-1;i++) cin>>t[i];
int ans=dp(),h=0,m=0,s=0;
h=ans/3600;
m=(ans-h*3600)/60;
s=ans-h*3600-m*60;
h+=8;
// if(h<=12){
// if(h<10) printf("0%d:",h);
// else printf("%d:",h);
// if(m<10) printf("0%d:",m);
// else printf("%d:",m);
// if(s<10) printf("0%d ",s);
// else printf("%d ",s);
// printf("am\n");
// }else{
// h-=12;
// if(h<10) printf("0%d:",h);
// else printf("%d:",h);
// if(m<10) printf("0%d:",m);
// else printf("%d:",m);
// if(s<10) printf("0%d ",s);
// else printf("%d ",s);
// printf("pm\n");
// }
if(h>12) //格式应用!!!
printf("%02d:%02d:%02d pm\n",h,m,s);
else
printf("%02d:%02d:%02d am\n",h,m,s);
}
return 0;
}