usaco 1.2.2

最新推荐文章于 2023-03-01 17:06:39 发布

wwx233

最新推荐文章于 2023-03-01 17:06:39 发布

阅读量249

点赞数

分类专栏： usaco

本文链接：https://blog.csdn.net/wwx233/article/details/75100813

版权

usaco 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Milking cows

/*
ID: wangwen4 
LANG: C++
TASK: milk2
*/
#include<bits/stdc++.h>
using namespace std;

struct cow
{
    int l;
    int r;
}m[6000];
bool cmp(cow a,cow b)
{
    return a.l < b.l;
}
int main()
{
    ofstream fout ("milk2.out");
    ifstream fin ("milk2.in");
    int n = 0;
    fin >> n;
    //cin >> n;
    for(int i = 0;i < n;i++)
    {
        fin >> m[i].l >> m[i].r;
        //cin >> m[i].l >> m[i].r;
    }
    sort(m,m+n,cmp);
    int l = m[0].l;
    int r = m[0].r;
    int sum1 = r-l;
    int sum2 = 0;
    int t1 = 0,t2 = 0;
    for(int i = 1;i < n;i++)
    {
        if(m[i].l <= r)
        {
            t2 = 0;
            if(m[i].r > r)
            {
                r = m[i].r;
            }
            t1 = r-l;
            sum1 = max(sum1,t1);
        }
        if(m[i].l > r)
        {
            t1 = 0;
            t2 = m[i].l-r;
            l = m[i].l;
            r = m[i].r;
            sum2 = max(sum2,t2);
        }
    }
    fout << sum1 << " " << sum2 << endl;
    //cout << sum1 << " " << sum2 << endl;
}