zoukankan      html  css  js  c++  java
  • hdoj--1260--Tickets(简单dp)

    Tickets

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


    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:  1160 1074 1069 1159 1114


    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    #define MAX 101000
    int dp[MAX],man[MAX],two[MAX];
    int main()
    {
    	int t;
    	scanf("%d",&t);
    	while(t--)
    	{
    		int n;
    		scanf("%d",&n);
    		memset(man,0,sizeof(man));
    		memset(two,0,sizeof(two));
    		for(int i=1;i<=n;i++)
    		scanf("%d",&man[i]);
    		for(int i=2;i<=n;i++)
    		scanf("%d",&two[i]);
    		memset(dp,0,sizeof(dp));
    		dp[1]=man[1];
    		for(int i=2;i<=n;i++)
    		dp[i]=min(dp[i-1]+man[i],dp[i-2]+two[i]);
    		int p=28800+dp[n];
    		int h=p/3600;
    		int m=p%3600/60;
    		int s=(p%3600)%60;
    		if(p>=43200)
    		{
    			if(h>12)
    			h-=12;
    			printf("%02d:%02d:%02d pm
    ",h,m,s);
    		}
    		else
    		printf("%02d:%02d:%02d am
    ",h,m,s);
    	}
    	return 0;
    }

     
  • 相关阅读:
    MySQL执行计划解读(转载)
    排序算法
    Linux下在防火墙中开启80端口、3306端口
    Android APN
    PB之——DropDownListBox 与 DropDownPictureListBox
    CSS总则。
    WIN7系统中设置默认登录用户
    Javascript日期比较
    myeclipse中UTF-8设置
    webview loadUrl() 弹出系统浏览器解决办法
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273714.html
Copyright © 2011-2022 走看看