hdu---1260---Tickets

http://acm.hdu.edu.cn/showproblem.php?pid=1260

刚开始以为一个人只能和其相邻的其中一个来实现贪心 

其实一个人（如果前后都有人）可以多次结合用来贪心

 

 

Tickets

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

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

浙江工业大学第四届大学生程序设计竞赛

 

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:   1257  1160  1231  1074  1069 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include<vector>
#include<algorithm>
using namespace std;
#define PI 3.1415926

const int maxn=10007;
const int INF=0x3f3f3f3f;

int dp[maxn], a[maxn], c[maxn];

int main()
{
    int T;
    scanf("%d", &T);

    while(T--)
    {
        int n;
        scanf("%d", &n);

        for(int i=1; i<=n; i++)
            scanf("%d", &a[i]);

        for(int i=2; i<=n; i++)
            scanf("%d", &c[i]);


        memset(dp, 0, sizeof(dp));
        dp[1]=a[1];

        ///刚开始以为一个人只能和其相邻的其中一个来实现贪心
        ///其实一个人（如果前后都有人）可以多次结合用来贪心
        for(int i=2; i<=n; i++)
            dp[i]=min(dp[i-1]+a[i], dp[i-2]+c[i]);

        int hh=dp[n]/3600;
        int mm=(dp[n]%3600)/60;
        int ss=dp[n]%60;

        printf("%02d:%02d:%02d%s\n", (hh+8)%24, mm, ss, (hh+8)%24>12?" pm":" am");
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/w-y-1/p/5748437.html