HDU1260 Tickets dp

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

原创最新推荐文章于 2021-08-30 14:52:22 发布 · 155 阅读

1 ·

CC 4.0 BY-SA版权

dp动态规划专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种通过优化算法减少电影票售卖总时间的方法。针对单一或相邻两人同时购票的情况，利用动态规划算法求解售票员最早下班时间，并提供了一个具体的实现案例。

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

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

思路：

今天有点累，不想多说了，dp已经写出来了，直接给转移方程：dp[ i ] = min(dp[ i - 1] + a[ i - 1] , dp[ i - 2] + b [ i - 2],我是从0为开始下标

代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include<queue>
#define ll long long
#define mem(a) memset(a,-1,sizeof(a))
using namespace std;
const int maxn = 2005;
int dp[maxn],a[maxn],b[maxn];
int main()
{
   int t;
   scanf("%d",&t);
   while (t --)
   {
       mem(dp);
       int n,ans = 0;
       scanf("%d",&n);
       for (int i = 0;i < n;i ++)
           scanf("%d",&a[i]);
       for(int i = 0;i < n - 1;i ++)
           scanf("%d",&b[i]);
       dp[0] = 0,dp[1] = a[0];
       for (int i = 2;i <= n;i ++)
           dp[i] = min(dp[i - 1] + a[i - 1],dp[i - 2] + b[i - 2]);
       ans = dp[n];
       int h = 8 + ans / 3600;
       ans = ans - ans / 3600 * 3600;
       int min = ans / 60;
       ans = ans - ans / 60 * 60;
       int s = ans;
       printf("%.2d:%.2d:%.2d ",h,min,s);
       if (h >= 12) printf("pm\n");
       else printf("am\n");
   }
   return 0;
}