HDU 1260 Tickets 【dp】

最新推荐文章于 2022-02-10 06:30:00 发布

Puya

最新推荐文章于 2022-02-10 06:30:00 发布

阅读量290

点赞数

CC 4.0 BY-SA版权

分类专栏： HDU 动态规划

本文链接：https://blog.youkuaiyun.com/Puyar_/article/details/54670236

HDU 同时被 2 个专栏收录

175 篇文章

订阅专栏

动态规划

44 篇文章

订阅专栏

本文探讨了一种通过优化售票流程来减少顾客等待时间的方法。具体地，通过允许相邻的顾客一起购买电影票来提高售票效率，并使用动态规划算法确定最优售票方案。

Tickets

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3501 Accepted Submission(s): 1767

Problem Description

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

Source

浙江工业大学第四届大学生程序设计竞赛

状态转移方程为： dp[i] = min(dp[i-1]+a[i] , dp[i-2] + cp[i] )。

当前第i个人分为两种情况，一是单独买，而是和前面的一块买。

#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long LL;
const int INF=0x7ffffff;

const int M=2e3+10;
int a[M],cp[M];
int dp[M];
int i,j,k,n,m,t,x;

int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&k);
         MS(dp,0);
         MS(a,0);
         MS(cp,0);
        for(i=1;i<=k;i++)scanf("%d",&a[i]);
        for(i=2;i<=k;i++)scanf("%d",&cp[i]);
        dp[1]=a[1];
        for(i=2;i<=k;i++)
            dp[i]=min(dp[i-1]+a[i],dp[i-2]+cp[i]);
        printf("%02d:%02d:%02d am\n",dp[k]/3600+8,dp[k]/60%60,dp[k]%60);
    }
    return 0;
}