Code highlighting produced by Actipro CodeHighlighter (freeware)

http://www.CodeHighlighter.com/







/*

ID: lc198901

PROG: milk2

LANG: C  

*/

#include<iostream>

#include<vector>

#include<algorithm>

#include<fstream>

using namespace std;

struct my_pair

{

    int first, second;

    my_pair(int _f, int _s):first(_f), second(_s){}

};



template<typename T>

struct pair_cmp_first

{

    bool operator () (const T& _L, const T& _R)

    {return    _L.first < _R.first;}

};



//两个struct结构体由飞雪帮助 表示感谢

int main()

{

    ifstream fin("milk2.in");

    ofstream fout("milk2.out");

    int n;

    fin>>n;

    vector<my_pair> Time;

    for(int j=0;j!=n;  j)

    {

        int temp1,temp2;

        fin>>temp1>>temp2;

        Time.push_back(my_pair(temp1,temp2));

    }

    sort(Time.begin(), Time.end(), pair_cmp_first<my_pair>()); //按照起始时间从小到大排序

    vector<int> MilkTime,NoMilkTime;

    int beg=0,i=0;

    int endTime=Time[beg].second;

    while(i!=n)

    {

        int begTime=Time[beg].first;

        if((i!=n-1)&&(Time[i 1].first-endTime<=0))

        {

            endTime=max(endTime,Time[i 1].second);

            begTime=min(begTime,Time[i 1].first);

            MilkTime.push_back(endTime-begTime);

            i  ;

        }

        else

        {

            beg=i 1;

            i=beg;

            if(i!=n)

                NoMilkTime.push_back(Time[i].first-Time[i-1].second);

        }

        

    }

    MilkTime.push_back(Time[n-1].second-Time[n-1].first);

    NoMilkTime.push_back(0);

    int pos1=max_element(MilkTime.begin(),MilkTime.end())-MilkTime.begin(),

        pos2=max_element(NoMilkTime.begin(),NoMilkTime.end())-NoMilkTime.begin();

    fout<<MilkTime[pos1]<<" "<<NoMilkTime[pos2]<<endl;

    return 0;

}