# Tickets

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

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
2 2 20 25 40 1 8

Sample Output
08:00:40 am 08:00:08 am

<pre name="code" class="cpp">#include<stdio.h>
#include<string.h>
#include<algorithm>
#define M 2010
using namespace std;
int a[M],b[M],dp[M];
int main()
{
int T,i,n,sum,s,m,h;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
memset(dp,0,sizeof(dp));
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=2;i<=n;i++)
{
scanf("%d",&b[i]);
}
dp[1]=a[1];
for(i=2;i<=n;i++)
dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i]);
sum=dp[n];
s=0;m=0;h=0;
if(sum>60)
{
s=sum%60;
m=(sum-s)/60;
h=m/60;
m=m%60;
}
else
s=sum;
h+=8;
if(h>12)
printf("%02d:%02d:%02d pm\n",h,m,s);
else
printf("%02d:%02d:%02d am\n",h,m,s);
}
return 0;
}

• 本文已收录于以下专栏：

## hdoj 1260 Tickets

E - DP Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit   Sta...
• leibniz_zhang
• 2016年04月20日 23:36
• 192

## hdoj1260【简单DP】

• KEYboarderQQ
• 2016年07月13日 11:32
• 204

## HDOJ 题目1260 Tickets（动态规划）

Tickets Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total ...
• yu_ch_sh
• 2014年10月31日 20:53
• 367

## hdu 1260 Tickets（dp）

• ljd4305
• 2014年05月07日 13:23
• 772

## [ACM] hdu 1260 Tickets （动态规划）

Tickets Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Sub...
• sr19930829
• 2014年05月03日 14:12
• 1445

## HDU：1260 Tickets（动态规划DP）

Tickets Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total ...
• zugofn
• 2016年08月08日 23:57
• 280

## HDOJ -- 1260 Tickets

Tickets Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Descr...
• ah_yeah
• 2016年08月09日 16:08
• 68

## 动态规划 hdu 1260 Tickets

Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. Howeve...
• u012077163
• 2013年12月13日 22:32
• 805

## hdu 1260 Tickets 动态规划

• zchahaha
• 2016年03月18日 20:32
• 356

## hdoj 1260 Tickets 【简单DP】

Tickets Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To...
• chenzhenyu123456
• 2015年08月17日 16:39
• 388

举报原因： 您举报文章：hdoj 1260 Tickets 【动态规划】 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)