题目:http://acm.hdu.edu.cn/showproblem.php?pid=1260
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
这是一道线性DP的题目,dp[i]表示卖了i张票所用的最少时间。转移方程为dp[i]=min(dp[i-1]+t1[i],dp[i-2]+t2[i])
将相邻的相邻的两张票所用的时间和这相邻的两张票的后一张票的对其 ,所以如果前i-1张票加上第i张票的时间大于前i-2张票所用的时间加上两张票共同用的时间,那么就选用第二种方案。刚开始我将两张相邻的票的所用的时间和前一张对齐,导致下标总是出错。这道题还有就是时间的处理上,第一次我没有加pm 这个情况,过了,第二次加了也过了。
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define maxn 2005
using namespace std;
int dp[maxn];
int t1[maxn],t2[maxn];
int k;
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
scanf("%d",&k);
for(int i=1;i<=k;i++)
scanf("%d",&t1[i]);
for(int i=2;i<=k;i++)
scanf("%d",&t2[i]);
dp[0]=0,dp[1]=t1[1];
for(int i=2;i<=k;i++)
dp[i]=min(dp[i-1]+t1[i],dp[i-2]+t2[i]);
int H=0,M=0,S=0;
H=dp[k]/3600+8;
M=dp[k]/60%60;
S=dp[k]%60;
if(H<12)
printf("%02d:%02d:%02d am\n",H,M,S);
else printf("%02d:%02d:%02d pm\n",H,M,S);
}
return 0;
}