dp最少买票时间
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
题目大意
可以一个人单独买一张票,也可以两个人一起买票,给了n个人单独买票需要的时间 和 相邻两个人一起买票需要的时间,求所有人买完票需要的最少时间。
状态转移方程:
dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i]);
单独买 和 两人一起买
dp[i-2]+b[i] //dp[i-2]因为 b[i]表示第 i 和 i-1 个人
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 2100
int a[N],b[N];//b表示两个人合在一起
int dp[N];
int main()
{
int n,i,t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=2;i<=n;i++)
scanf("%d",&b[i]);
dp[1]=a[1];
dp[2]=min(a[1]+a[2],b[2]);
for(i=3;i<=n;i++)
{
dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i]);
//dp[i-2]+b[i] dp[i-2]因为 b[i]表示第 i 和 i-1 个人
}
int h,s,m;
h=(dp[n]/3600+8)%24;
m=dp[n]%3600/60;
s=dp[n]%60;
printf("%02d:%02d:%02d am\n",h,m,s);
}
return 0;
}