HDU 1260 Tickets (简单DP)
来源:互联网 发布:vb能做到人脸识别吗 编辑:程序博客网 时间:2024/06/05 01:20
Tickets
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2364 Accepted Submission(s): 1152
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.
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.
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
2220 254018
Sample Output
08:00:40 am08:00:08 am
题意:有n个人买票,可以一人买一张,花费时间是a[i],也可以相邻两个人一起买一张两人票,花费时间是b[i],
现在求n个人买票需要的最少时间是多少。
分析:
dp[ i ] = min { dp[ i-1 ] + a[ i ] , dp[ i-2 ] + b[ i ] };
代码如下:
#include <stdio.h>int main(){int n;int T,i,j;int a[2005],b[2005],dp[2005];char sh[3]="am";scanf("%d",&T);while(T--){int h,m,s;h=8;s=m=0;scanf("%d",&n);for(i=1;i<=n;i++)scanf("%d",a+i);for(i=2;i<=n;i++)scanf("%d",b+i);dp[0]=0;dp[1]=a[1];for(i=2;i<=n;i++){if(dp[i-1]+a[i]<dp[i-2]+b[i])dp[i]=dp[i-1]+a[i];elsedp[i]=dp[i-2]+b[i];}s=dp[n]%60;m=dp[n]/60;h=h+m/60;m%=60;h%=24;if(h>12){sh[0]='p';h-=12;}elsesh[0]='a';printf("%02d:%02d:%02d %s\n",h,m,s,sh);}return 0;}
0 0
- HDU 1260 Tickets (简单DP)
- HDU 1260 Tickets 简单DP
- hdu Tickets 1260 (简单DP)
- HDU 1260 Tickets 简单dp
- [简单DP]Tickets HDU
- HDU 1260 Tickets(简单DP)
- 【HDU】-1260-Tickets(简单DP)
- hdu 1260 Tickets 【dp】
- hdu 1260 Tickets(dp)
- hdu 1260 tickets dp
- hdu 1260 Tickets dp
- HDU - 1260 Tickets(DP)
- DP-HDU-1260-Tickets
- HDU 1260 Tickets (DP)
- hdu-1260 Tickets【dp】
- HDU-1260 Tickets(DP)
- HDU-1260-Tickets【DP】
- HDU 1260 Tickets 【dp】
- Mac OS中添加环境变量
- C-Hexagons!
- Widget对应QWidget类的用法
- 看完这个,你还认为自己懂勾股定理吗?
- 剑指offer题目记录
- HDU 1260 Tickets (简单DP)
- [LeetCode]318. Maximum Product of Word Lengths
- 3876: [Ahoi2014]支线剧情 有上下界的费用流
- 初等数论四大定理之——费马小定理
- spring的aop 基于schema
- mybatis--原始dao和代理Mapper
- D-Professor GukiZ's Robot
- 链表排序
- 线程的取消/撤销