HDU1260 Tickets DP
来源:互联网 发布:网络歌手麦子 编辑:程序博客网 时间:2024/04/25 07:43
Tickets
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
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
题解
简单的DP题,只是题目一开始有点难懂
状态转移方程是:dp[i] = min(dp[i-1]+单独买花的时间, dp[i-2]+和前面那个人一起买花的时间
初始状态是dp[1] = 第一个人单独买花的时间
代码
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int dp[2001];int s[2001];int d[2001];int main(){ int t; scanf("%d",&t); while(t--) { int n; 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(s[i]+dp[i-1],dp[i-2]+d[i]); int hh = dp[n]/ 3600; int mm = dp[n]%3600/60; int ss = dp[n]%60; printf("%02d:%02d:%02d am\n",(8+hh)%24,mm,ss); }}
- HDU1260 Tickets DP
- hdu1260 Tickets(DP)
- HDU1260 Tickets
- HDU1260 Tickets
- [HDU1260]-Tickets
- hdu1260 Tickets(动态规划)
- hdu1260 水dp
- HDU1260简单DP
- HDU1260-基础DP-H
- HDU1260 动态规划 简单DP
- hdu1260
- Tickets 【dp】
- [SGU390]Tickets && 数位DP
- hdu 1260 Tickets 【dp】
- hdu 1260 Tickets(dp)
- hdu 1260 tickets dp
- poj2346--Lucky tickets+DP
- hdu 1260 Tickets dp
- 关于CocoaPods的使用小说明
- LSMW 标准批导程序扩充物料视图(MM01) STANDART BATCH/DIRECT INPUT
- 新浪分享 Insufficient app permissions!
- C++标准库——简介
- Android 料阅读及视频观看,先下载后打开
- HDU1260 Tickets DP
- 重定位cout到文件,不输出到屏幕
- 大表数据插入批量提交
- Activity生命周期
- Swift禁止横屏
- NIO
- python入门--基本数据类型
- [Mac技巧]非Mac键盘/PC键盘 互换Win Alt 按键功能
- Magento2 create a new module