HDU1260简单DP

这个DP比较简单
dp存的就是当前最小值的状态
要知道最新的这个只考虑这么几种状态
一个就是最后边这个是单个的，一个就是最后这个是连体的
那么这就很简单了~~~

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int k[2001];
int kq[2002];
int dp[5000];
int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int n;
        cin >> n;
        for (int a = 0;a <= n;a++)dp[a] =0;
        for (int a = 1;a <= n;a++)scanf("%d", &k[a]);
        for (int a = 2;a <= n;a++)scanf("%d", &kq[a]);
        kq[1] = k[1];
        dp[1] = k[1];
        for (int a = 2;a <= n;a++)dp[a] = min(dp[a - 1] + k[a], dp[a - 2] + kq[a]);
        //cout << dp[n] << endl;
        int xiaoshi=8;
        int fen = 0;
        int miao = 0;
        int shangxia = 0;
        int tt = dp[n] / 3600;
        if (((tt+xiaoshi) / 12) == 1)shangxia = 1;
        xiaoshi = (xiaoshi + tt) % 12;
        dp[n] = dp[n] % 3600;
        fen = fen + (dp[n] / 60);
        dp[n] = dp[n] % 60;
        miao = dp[n];
        if (shangxia == 0)printf("%.2d:%.2d:%.2d am\n", xiaoshi, fen, miao);
        else printf("%.2d:%.2d:%.2d pm\n", xiaoshi, fen, miao);
    }
    return 0;
}