제출 #83661

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83661		nikolapesic2802	무제 (POI11_tem)	C++14	24 / 100	984 ms	33792 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back

const int N=1e6+5;
vector<int> lo(N),hi(N);
void fastscan(int &number)
{
    bool negative = false;
    register int c;
    number = 0;
    c = getchar();
    if (c=='-')
    {
        negative = true;
        c = getchar();
    }
    for (; (c>47 && c<58); c=getchar())
        number = number *10 + c - 48;
    if (negative)
        number *= -1;
}
int main()
{
    int n;
    //scanf("%i",&n);
    fastscan(n);
    for(int i=0;i<n;i++)
        fastscan(lo[i]),fastscan(hi[i]);
        //scanf("%i %i",&lo[i],&hi[i]);
    multiset<int,greater<int> > mins;
    int res=1;
    int s=0;
    mins.insert(lo[0]);
    for(int i=1;i<n;i++)
    {
        while(mins.size()&&*mins.begin()>hi[i])
        {
            mins.erase(mins.find(lo[s]));
            s++;
        }
        mins.insert(lo[i]);
        res=max(res,i-s+1);
    }
    printf("%i\n",res);

    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9