H - Tickets 【DP】

最新推荐文章于 2020-03-01 23:57:53 发布

Irish_Moonshine

最新推荐文章于 2020-03-01 23:57:53 发布

阅读量304

点赞数

分类专栏： Algorithm

本文链接：https://blog.csdn.net/Irish_Moonshine/article/details/78412588

版权

Algorithm 专栏收录该内容

219 篇文章 2 订阅

订阅专栏

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

题意：每一个人有自己的花费，相邻的两个人有一个花费，最后求总花费最小。
On的时间复杂度
$dp[i] = min((dp[i - 1] + a[i]), (dp[i - 2] + c[i - 1]));$

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
const int maxn = 2e3 + 10;
#define INF 0x3f3f3f3f
int n; int T; int k;
int dp[maxn];
int a[maxn];
int c[maxn];
int main()
{
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d", &k);
        memset(dp, INF, sizeof(dp));
        dp[0] = 0;
        for (int i = 1; i <= k; i++)
        {
            scanf("%d", &a[i]);
        }
        for (int i = 1; i <= k - 1; i++)
        {
            scanf("%d", &c[i]);
        }
        dp[1] = a[1];
        for (int i = 2; i <= k; i++)
        {
            dp[i] = min((dp[i - 1] + a[i]), (dp[i - 2] + c[i - 1]));
        }
        //printf("%d\n", dp[k]);
        int s_t=8, f_t=0, m_t=0;
        m_t += dp[k];
        f_t += m_t / 60;
        m_t %= 60;
        s_t += f_t / 60;
        f_t %= 60;
        if (s_t >= 12)
            printf("%02d:%02d:%02d pm\n", s_t, f_t, m_t);
        else
            printf("%02d:%02d:%02d am\n", s_t, f_t, m_t);
    }
    return 0;
}