HDU 1260 Tickets 【dp】
来源:互联网 发布:用织梦cms侵权 编辑:程序博客网 时间:2024/06/11 12:31
Tickets
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3501 Accepted Submission(s): 1767
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
Source
浙江工业大学第四届大学生程序设计竞赛
状态转移方程为: dp[i] = min(dp[i-1]+a[i] , dp[i-2] + cp[i] )。
当前第i个人分为两种情况,一是单独买,而是和前面的一块买。
#include<cstdio>#include<cmath>#include<cstring>#include<climits>#include<string>#include<queue>#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<climits>#include<string>#include<queue>#include<stack>#include<set>#include<map>#include<algorithm>using namespace std;#define rep(i,j,k)for(i=j;i<k;i++)#define per(i,j,k)for(i=j;i>k;i--)#define MS(x,y)memset(x,y,sizeof(x))#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1typedef long long LL;const int INF=0x7ffffff;const int M=2e3+10;int a[M],cp[M];int dp[M];int i,j,k,n,m,t,x;int main(){ int T; scanf("%d",&T); while(T--){ scanf("%d",&k); MS(dp,0); MS(a,0); MS(cp,0); for(i=1;i<=k;i++)scanf("%d",&a[i]); for(i=2;i<=k;i++)scanf("%d",&cp[i]); dp[1]=a[1]; for(i=2;i<=k;i++) dp[i]=min(dp[i-1]+a[i],dp[i-2]+cp[i]); printf("%02d:%02d:%02d am\n",dp[k]/3600+8,dp[k]/60%60,dp[k]%60); } return 0;}
0 0
- 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】
- 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)
- 矩阵特征值分解与奇异值分解(SVD)含义解析及应用
- floyd 算法 带输出路劲
- PAT---B1002. 写出这个数 (20)
- MemoryAnalyzer-内存泄露分析工具
- 初探MeidaPlayer底层实现(二)
- HDU 1260 Tickets 【dp】
- gradle-build.bat
- C++初步(5)
- 二叉树的插入和按层遍历
- set-env.bat
- 简易秒表
- ASP.NET Core MVC-WebAPi如何构建路由?
- 【Java】Java编译错误:需要class,interface或enum
- 传说