hdoj 1260 Tickets 【动态规划】

原创 2015年11月17日 20:20:14

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
 


题意:有T组数据,每组输入一个n表示有n个时间 ,接下来输入n个数a[ ],对应n个人每个人的时间,再输入n-1个数b[ ],表示相邻两个人一块所需的时间。求最小时间。


思路: 动态规划,用dp数组存储最小时间。例如a[1]=1,a[2]=2,a[3]=3...b[2]=2,b[3]=3.先使a[1]+a[2]与b[2]比较,取最小为dp[2];然后让dp[2]+a[3]与a[1]+b[3]比较,取最小为dp[3]。依次向后运算,则dp[n]为最小时间。


代码:


<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;
}




相关文章推荐

HDU:1260 Tickets(动态规划DP)

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

[ACM] hdu 1260 Tickets (动态规划)

Tickets Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Sub...

杭电1260 Tickets 动态规划

Tickets Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total...
  • z8110
  • z8110
  • 2016年03月22日 21:44
  • 164

hdu1260Tickets(动态规划)

Problem Description Jesus, what a great movie! Thousands of people are rushing to the cinema. How...
  • zs520ct
  • zs520ct
  • 2016年04月14日 13:45
  • 115

hdu1260 Tickets(动态规划)

Tickets Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To...

poj 1260 Pearls 动态规划

动态规划的简单题,新手锻炼思维很合适

动态规划 III——A - Railway tickets

//其实大概的中心思想是:车从起始站出发,每到一个站就要票价最优化。如何最优化,就是每到的一个站,就要从这个站前面所有的站(到起始站为止)的相互相邻两两距离(不超过L3)来判断取哪个票价。两两距离取票...

动态规划(DP) 之优先队列优化 HDOJ 3401Trade

HDOJ 3401题目连接     告诉你 T 天里,物品的买卖价格,和当天最多买卖数量,还有 T 天里最多保存物品数量,每一次买卖间隔时间必须大于 w+1   很容易想到DP【i】【j】表...
  • HH_YT
  • HH_YT
  • 2013年05月17日 13:03
  • 753

HDOJ 题目1978How many ways(动态规划)

How many ways Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

HDOJ 题目1176 免费馅饼(动态规划)

免费馅饼 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Sub...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj 1260 Tickets 【动态规划】
举报原因:
原因补充:

(最多只允许输入30个字)