Tickets HDU - 1260（DP)

最新推荐文章于 2021-08-30 14:52:22 发布

浮生一朝

最新推荐文章于 2021-08-30 14:52:22 发布

阅读量428

点赞数

CC 4.0 BY-SA版权

分类专栏：基础DP 文章标签： dp

本文链接：https://blog.youkuaiyun.com/Fusheng_Yizhao/article/details/78347227

基础DP 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种通过算法优化电影票销售过程的方法，旨在减少顾客购票时间并提高售票效率。文章详细阐述了如何利用动态规划解决售票场景中的时间优化问题，并提供了一个具体的实现案例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

 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

题意：一个人可以单独买票花费一定的时间，也可以两个人一起买票，也给定一个时间，给出K个人的单独买票时间和K-1个相邻的两个人一起买票的时间，问一共花费的最小时间。用one[i]为每个人单独买票的时间，two[ i+1]为两个人一起买票的时间。
状态转移方程为： dp[i] = min(dp[i-1]+one[i] , dp[i-2] + two[i] )。当前第i个人分为两种情况，一是单独买，而是和前面的一块买。

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int n,k;
int dp[2050],one[2050],two[2050];
int min(int a,int b)
{
    return a < b ? a : b;
}
int main()
{
    int i;
    scanf("%d",&n);
    while(n--)
    {
       memset(dp,0,sizeof(dp));
       memset(one,0,sizeof(one));
       memset(two,0,sizeof(two));
       scanf("%d",&k);
       for(i=1;i<=k;i++)
       {
         scanf("%d",&one[i]);
       }
       for(i=2;i<=k;i++)
       {
           scanf("%d",&two[i]);
       }
       dp[0] = 0;
       dp[1] = one[1];
       for(i=2;i<=k;i++)
       {
          dp[i] = min(dp[i-1]+one[i],dp[i-2]+two[i]);
       }
       int h = dp[k]/3600 +8;
       int m = dp[k]/60%60;
       int s = dp[k]%60;
       printf("%02d:%02d:%02d am\n",h,m,s);
    }
    return 0;
}