Submission #112079

#TimeUsernameProblemLanguageResultExecution timeMemory
112079aer0park무제 (POI11_tem)C++14
0 / 100
244 ms37128 KiB
#include <bits/stdc++.h>
#define f first
#define s second

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pi;

ll n,l[1000005],h[1000004],anw,nw;
deque<pi> dq;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>l[i]>>h[i];
        while(!dq.empty()&&dq.back().f>h[i]) dq.pop_back();
        if(!dq.empty())
			dq.push_back({max(dq.back().f,l[i]),i});
		else
			dq.push_back({l[i],i});
        anw=max(anw,(ll)dq.size());
    }
    cout<<anw;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...