HDU 1260 Tickets DP
来源:互联网 发布:网络终端机服务器软件 编辑:程序博客网 时间:2024/05/16 05:37
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.
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.
2220 254018
08:00:40 am08:00:08 am
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<algorithm>#include<iostream>using namespace std;int t1[2050],t2[2050];int dp[2050];int main(){int n;scanf("%d",&n);while(n--){memset(dp,0,sizeof(dp));int p;scanf("%d",&p);for(int i=1;i<=p;i++)scanf("%d",&t1[i]);if(p>=2)for(int i=1;i<=p-1;i++)scanf("%d",&t2[i]);dp[1]=t1[1];for(int i=2;i<=p;i++){dp[i]=min(dp[i-1]+t1[i] , dp[i-2]+t2[i-1]);}int hour=dp[p]/3600 +8;int minute=(dp[p]%3600)/60;int second=dp[p]%60;printf("%02d:%02d:%02d ",hour,minute,second);if(hour<12)printf("am\n");elseprintf("pm\n");}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)
- [Struts2] ModelDriven和Preparable拦截器
- Java 动态生成jpg图片
- [Struts2] OGNL s:iterator标签的使用
- [Struts2] page、request、session、application的区别
- 标准I/O
- HDU 1260 Tickets DP
- [Struts2] pageContext.request.contextPath
- 29.装饰者模式
- Redis常见7种使用场景(PHP实战)
- Java课设--俄罗斯方块Tetris
- 断点续传下载原理实现
- Mybatis Generator最完整配置详解
- initramfs 简介,一个新的 initial RAM disks 模型
- java线程详解