L - Tickets （dp）

最新推荐文章于 2022-07-07 16:27:06 发布

ZZ --瑞 hopeACMer

最新推荐文章于 2022-07-07 16:27:06 发布

阅读量182

点赞数

分类专栏：重新学编程之入门dp 文章标签：训练

本文链接：https://blog.csdn.net/qq_44134712/article/details/97101462

版权

重新学编程之入门dp 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

本文介绍了一种优化算法，用于解决电影票售卖问题。通过允许相邻顾客一起购票，该算法帮助售票员Joe尽可能早地完成工作。输入包含若干场景，每场景给出顾客单独购票和相邻顾客共同购票所需的时间，输出则是最早下班时间。

摘要由CSDN通过智能技术生成

L - Tickets

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

Sample Output

08:00:40 am
08:00:08 am

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
using namespace std;

int main()
{
    int a,i,b,x,y,z;
    int n[2010],m[2010],dp[2010];
    cin >> a;
    while(a--)
    {
        memset(n,0,sizeof(n));
        memset(m,0,sizeof(m));
        memset(dp,0,sizeof(dp));
        cin >> b;
        for(i=1; i<=b; i++)
        {
            cin >> n[i];
        }
        for(i=2; i<=b; i++)
        {
            cin >> m[i];
        }
        dp[1]=n[1];
        for(i=2; i<=b; i++)
        {
            dp[i]=min(dp[i-1]+n[i],dp[i-2]+m[i]);//一个一个加和连续的两个比较哪个小
        }
        x=dp[b]/3600+8;
        y=dp[b]/60%60;
        z=dp[b]%60;
        printf("%02d:%02d:%02d am\n",x,y,z);
    }
    return 0;
}