zoukankan      html  css  js  c++  java
  • USACO 1.2 MILKING COWS

    Milking Cows

    Three farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (measured in seconds after 5 am) and ends at time 1000. The second farmer begins at time 700 and ends at time 1200. The third farmer begins at time 1500 and ends at time 2100. The longest continuous time during which at least one farmer was milking a cow was 900 seconds (from 300 to 1200). The longest time no milking was done, between the beginning and the ending of all milking, was 300 seconds (1500 minus 1200).

    Your job is to write a program that will examine a list of beginning and ending times for N (1 <= N <= 5000) farmers milking N cows and compute (in seconds):

    • The longest time interval at least one cow was milked.
    • The longest time interval (after milking starts) during which no cows were being milked.

    PROGRAM NAME: milk2

    INPUT FORMAT

    Line 1: The single integer Lines 2..N+1: Two non-negative integers less than 1000000, the starting and ending time in seconds after 0500

    SAMPLE INPUT (file milk2.in)

    3
    300 1000
    700 1200
    1500 2100
    
    

    OUTPUT FORMAT

    A single line with two integers that represent the longest continuous time of milking and the longest idle time.

    SAMPLE OUTPUT (file milk2.out)

    900 300
    


    这道题钟神说用离散化来做,坐了半天还是不懂。。。。。囧。。。。。只好写个裸的了
    View Code
     1 /*
     2 ID:kaisada2
     3 PROG:milk2
     4 LANG:C++
     5 */
     6 #include<iostream>
     7 #include<string.h>
     8 #include<algorithm>
     9 #include<cstdio>
    10 #include<cstdlib>
    11 #include<cstring>
    12 
    13 
    14 using namespace std;
    15 
    16 char a[1000000]; 
    17 
    18 int main()
    19 {
    20     freopen("milk2.in","r",stdin);
    21     freopen("milk2.out","w",stdout);
    22     long n,i,j,x,y,max=0,min=10000000;
    23     int ans[2]={0,0};
    24     memset(a,0,sizeof(a));
    25     cin>>n;
    26     for(i=0;i<n;i++)
    27     {
    28         cin>>x>>y;
    29         y--;
    30     if(x<min) min=x;
    31     if(y>max) max=y;
    32         for(j=x;j<=y;j++)a[j]=1;
    33     }
    34 
    35     for(i=min;i<=max;i+=j)
    36     {
    37         for(j=0;a[i+j]==a[i];j++);
    38         if(j>ans[a[i]])ans[a[i]]=j;
    39     }
    40 
    41     cout<<ans[1]<<" "<<ans[0]<<endl;
    42     return 0;
    43 }
  • 相关阅读:
    IT职业选择与定位
    零碎时间应该拿来做什么
    编程漫谈(七):意义与自由
    第一次项目发布的心得体会
    入职一月的一点感想
    职业发展思考(一)
    健康先行: 每天锻炼一小时!!!
    2012, 软件职场之旅启程
    程序员的成长之路
    计算机学习方法
  • 原文地址:https://www.cnblogs.com/spwkx/p/2591379.html
Copyright © 2011-2022 走看看