zoukankan      html  css  js  c++  java
  • [HDU 1260] Tickets

    Tickets

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

    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
    浙江工业大学第四届大学生程序设计竞赛
     
    简单DP、上代码
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<algorithm>
    using namespace std;
    #define N 10010
    
    int n;
    int a[N],b[N];
    int dp[N]; //dp[i]表示前i个人花的最少时间
    
    int main()
    {
        int T,i;
        scanf("%d",&T);
        while(T--)
        {
            scanf("%d",&n);
            for(i=1;i<=n;i++)
            {
                scanf("%d",&a[i]);
            }
            for(i=1;i<n;i++)
            {
                scanf("%d",&b[i]);
            }
            dp[1]=a[1];
            dp[2]=min(a[1]+a[2],b[1]);
            for(i=3;i<=n;i++)
            {
                dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i-1]);
            }
            int h=8,m=0,s=0;
            s=dp[n]%60;
            m=dp[n]/60%60;
            h+=dp[n]/3600;
            if(h<12)
                printf("%02d:%02d:%02d am
    ",h,m,s);
            else
                printf("%02d:%02d:%02d pm
    ",h,m,s);
        }
        return 0;
    }
    趁着还有梦想、将AC进行到底~~~by 452181625
  • 相关阅读:
    css盒子模型 ( 基本针对兼容性问题有点帮助 )
    11.5 Array 数组
    11.5笔记 数组去重
    11.5笔记 函数
    11..2笔记 对象
    11.1笔记
    10.31笔记
    10.31笔记 作用域链
    10.15笔记 js
    10.8补
  • 原文地址:https://www.cnblogs.com/hate13/p/4052743.html
Copyright © 2011-2022 走看看