zoukankan      html  css  js  c++  java
  • HDU1260(KB12-H DP)

    Tickets

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 3917    Accepted Submission(s): 1968


    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.
     

    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
     

    Source

     
     1 //2017-04-04
     2 #include <iostream>
     3 #include <cstdio>
     4 #include <cstring>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 int s[2005], d[2005], dp[2005];//dp[i]表示前i个人所需要的最短时间
    10 //状态转移方程:dp[i] = min(dp[i-1]+s[i], dp[i-2]+d[i-1])
    11 
    12 int main()
    13 {
    14     int T, n;
    15     scanf("%d", &T);
    16     while(T--)
    17     {
    18         scanf("%d", &n);
    19         for(int i = 0; i < n; i++)
    20               scanf("%d", &s[i]);
    21         for(int i = 0; i < n-1; i++)
    22               scanf("%d", &d[i]);
    23         dp[0] = s[0];
    24         dp[1] = min(dp[0]+s[1], d[0]);
    25         for(int i = 2; i < n; i++)
    26               dp[i] = min(dp[i-1]+s[i], dp[i-2]+d[i-1]);
    27         int h, m, s;
    28         h = 8+dp[n-1]/3600;
    29         m = (dp[n-1]%3600)/60;
    30         s = dp[n-1]%60;
    31         if(h < 12)printf("%02d:%02d:%02d am
    ", h, m, s);
    32         else printf("%02d:%02d:%02d pm
    ", h, m, s);
    33     }
    34 
    35     return 0;
    36 }
  • 相关阅读:
    CF1328B K-th Beautiful String
    CF1327B Princesses and Princes
    CF750D New Year and Fireworks
    CF57C Array
    洛谷P5661 公交换乘(CSP-J 2019 T2)
    Docker原理:Cgroup
    Docker原理:Namespace
    Anaconda软件安装使用问题
    初步了解Unix系统的I/O模式
    深入理解索引和AVL树、B-树、B+树的关系
  • 原文地址:https://www.cnblogs.com/Penn000/p/6664822.html
Copyright © 2011-2022 走看看