2 2 20 25 40 1 8
08:00:40 am 08:00:08 am
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define N 2020
#define INF 1001000
using namespace std;
int n;
int a[N],b[N];
int dp[N][2];
int main() {
int t;
cin>>t;
while(t--) {
scanf("%d",&n);
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
b[0]=INF;
for(int i=2; i<=n; i++)
scanf("%d",&b[i]);
dp[1][0]=a[1];
dp[1][1]=INF;
dp[0][0]=0;
dp[0][1]=0;
for(int i=2; i<=n; i++) {
dp[i][0]=a[i]+min(dp[i-1][0],dp[i-1][1]);
dp[i][1]=b[i]+min(dp[i-2][0],dp[i-2][1]);
}
int ans=min(dp[n][1],dp[n][0]);
int se=ans%60;
ans/=60;
int mins=ans%60;
ans/=60;
int h=ans+8;
int flag=0;
if(h<10)printf("0%d:",h);
else if(h>=10&&h<=11)printf("%d:",h);
else {
int hh=h-12;
if(hh<10)printf("0");
printf("%d:",hh);
flag=1;
}
if(mins<10)printf("0");
printf("%d:",mins);
if(se<10)
printf("0");
printf("%d",se);
if(flag)printf(" pm\n");
else printf(" am\n");
}
}
原文:http://blog.csdn.net/acm_baihuzi/article/details/44574691