hdu 1260 Tickets dp

题意：某售票可以一次卖出一张票，或者卖出两张连票，卖出票时需要消耗时间。问n个人买到票的最少时间。

设dp【i】【0】表示第i个人的票不和i-1一起买时消耗的最小时间，dp【i】【1】表示与i-1这个人买消耗的最小时间，则有dp[i][0] = min( dp[i-1][0], dp[i-1][1] ) + c[i]; dp[i][1] = dp[i-1][0] + d[i] - c[i-1];

最后处理一下输出即可

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <math.h>
#include <time.h>
#include <stdio.h>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define asd puts("sdfsdfsdfsdfsdfsdf");
#define Mp(a, b) make_pair(a, b)
typedef long long ll;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 2020;

int c[N], d[N];
int dp[N][2];
int n;

int main()
{
	int tot;
	for( scanf("%d", &tot); tot--; ) {
		scanf("%d", &n);
		for( int i = 1; i <= n; ++i ) {
			scanf("%d", &c[i]);
		}
		for( int i = 2; i <= n; ++i ) {
			scanf("%d", &d[i]);
		}
		dp[1][1] = dp[1][0] = c[1];
		for( int i = 2; i <= n; ++i ) {
			dp[i][0] = min( dp[i-1][0], dp[i-1][1] ) + c[i];
			dp[i][1] = dp[i-1][0] + d[i] - c[i-1];
		}
		int ans = min( dp[n][1], dp[n][0] );
		if( ans >= 24 * 60 * 60 )
			ans %= 24 * 60 * 60;
		int mins = ans / 60;
		ans %= 60;
		int hours = 8 + mins / 60;
		mins %= 60;
		bool am = (hours < 12);
		printf("%02d:%02d:%02d %s\n", (hours+11)%12+1, mins%60, ans%3600, am? "am": "pm");
	}
	return 0;
}