USACO (Complete Search) : Milking Cows

problem Link : http://train.usaco.org/usacoprob2?a=SeMATkWVe9o&S=milk2


/*
PROG: milk2
LANG: C++
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define CIN ios_base::sync_with_stdio(0)
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,n) for(int i=0;i<n;i++)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#define PRINT_CASE printf("Case %d: ",z)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;
vector<pii>v;
int main()
{
    freopen("milk2.in","r",stdin);
    freopen("milk2.out","w",stdout);


    pii a;
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>a.ff>>a.ss;
        v.pb(a);
    }
    int x,y,ans1=0,ans2=0;
    sort(all(v));
    x=v[0].ff;y=v[0].ss;
    ans1=y-x;
    for(int i=1;i<SZ(v);i++)
    {
        if(v[i].ff<=y)
            {
                if(y<v[i].ss)
                    y=v[i].ss;
            }
        else
        {
            ans2=max(ans2,v[i].ff-y);
            ans1=max(ans1,y-x);
            x=v[i].ff;
            y=v[i].ss;
        }
    }

    cout<<ans1<<" "<<ans2<<endl;
    return 0;
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s