HDU 1260 Tickets
来源:互联网 发布:淘宝店铺首页装修代码 编辑:程序博客网 时间:2024/05/29 16:22
Tickets
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
【思路分析】
状态转移方程:dp[i] = Min(dp[i - 1] + s[i],dp[i - 2] + d[i])。
代码如下:
08:00:40 am08:00:08 am
【思路分析】
状态转移方程:dp[i] = Min(dp[i - 1] + s[i],dp[i - 2] + d[i])。
代码如下:
#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <algorithm>using namespace std;#define maxn 2005int Min(int x,int y){ return (x < y ? x : y);}int main(){ int t,n; int s[maxn],d[maxn]; int dp[maxn] = {0}; int hh,mm,ss; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i = 1;i <= n;i++) scanf("%d",&s[i]); for(int i = 2;i <= n;i++) scanf("%d",&d[i]); dp[1] = s[1]; for(int i = 2;i <= n;i++) dp[i] = Min(dp[i - 1] + s[i],dp[i - 2] + d[i]); hh = dp[n] / 3600; mm = dp[n] % 3600 / 60; ss = dp[n] % 60; printf("%02d:%02d:%02d%s\n", (8 + hh) % 24, mm, ss, (hh + 8) % 24 > 12 ? " pm":" am"); } return 0;}
0 0
- hdu 1260 Tickets
- hdu 1260 Tickets
- HDU 1260 Tickets
- hdu 1260 Tickets
- hdu 1260 Tickets
- hdu 1260 Tickets
- hdu 1260 Tickets 【dp】
- hdu—1260:Tickets
- hdu 1260 Tickets(dp)
- hdu 1260 tickets dp
- HDU 1260 Tickets
- hdu 1260 Tickets dp
- HDU 1260 Tickets
- HDU 1260 Tickets
- HDU - 1260 Tickets(DP)
- DP-HDU-1260-Tickets
- HDU 1260 Tickets
- HDU 1260 Tickets
- java时间的获取
- 修改android的statusbar的高度
- 4.1 在SELinux中客体类存在的目的
- 如何安全退出已调用多个Activity的Application?
- MVC+edmx+数据验证 分属多assembly
- HDU 1260 Tickets
- telnet命令
- 排序之二分排序
- oracle服务端安装
- js实现表格行的动态添加
- POJ-2488-A Knight's Journey-DFS
- 根据caffe,如何学习开源框架
- DOS命令
- NBUT 1225 NEW RDSP MODE I