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

    H - 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[i] = min(dp[i - 1] + s[i - 1], dp[i - 2] + d[i - 2])

    代码如下:

    /*************************************************************************
    	> File Name: Tickets.cpp
    	> Author: Zhanghaoran
    	> Mail: chilumanxi@xiyoulinux.org
    	> Created Time: Sat 24 Oct 2015 03:34:10 PM CST
     ************************************************************************/
    
    #include <iostream>
    #include <algorithm>
    #include <cstring>
    #include <cstdio>
    #include <cstdlib>
    
    using namespace std;
    
    int N;
    int K;
    int s[2100];
    int d[2100];
    int dp[2100];
    int main(void){
        scanf("%d", &N);
        while(N --){
            scanf("%d", &K);
            for(int i = 0; i < K; i ++)
                scanf("%d", &s[i]);
            for(int i = 0; i < K - 1; i ++)
                scanf("%d", &d[i]);
            dp[0] = 0;
            dp[1] = s[0];
            for(int i = 2; i <= K; i ++){
                dp[i] = min(dp[i - 1] + s[i - 1], dp[i - 2] + d[i - 2]);
            }
            //printf("%d
    ", dp[K]);
            char st[2];
            int h = 0;
            int m = 0;
            if(dp[K] > 3600){
                h = dp[K] / 3600;
                dp[K] %= 3600;
            }
            if(h >= 4){
                h = (8 + h) % 12;
                strcpy(st , "pm");
            }
            else{
                strcpy(st, "am");
                h = h + 8;
            }
            if(dp[K] > 60){
                m = dp[K] / 60;
                dp[K] %= 60;
            }
            printf("%02d:%02d:%02d %s
    ",h, m, dp[K], st);
        }
    }


  • 相关阅读:
    步入大公司一年及三十而立的一些思考
    let和const
    简明学习webpack
    npm&&yarn和package.json
    基于jQuery.i18n.properties插件实现前端页面国际化
    Sequence Model
    系统性整理项目:第一篇(续篇)-osm存入PostgreSQL+PostGIS并构建路网表结构
    系统性整理项目:第一篇(环境+数据)
    window下源码编译mmcv-full==1.2.1
    多边形平滑算法-ChaikinSmoothing
  • 原文地址:https://www.cnblogs.com/chilumanxi/p/5136073.html
Copyright © 2011-2022 走看看