Submission #1085955

#	Time	Username	Problem	Language	Result	Execution time	Memory
1085955		pokmui9909	Untitled (POI11_tem)	C++17	100 / 100	179 ms	28840 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int N, L[1000005], R[1000005];

int main(){
    cin.tie(0) -> sync_with_stdio(0);

    cin >> N;
    for(ll i = 1; i <= N; i++){
        cin >> L[i] >> R[i];
    }
    ll Ans = 0;
    deque<int> dq;
    for(ll i = 1, j = 0; i <= N; i++){
        while(j < N && (dq.empty() || R[j + 1] >= L[dq.front()])){
            j++;
            while(!dq.empty() && L[dq.back()] <= L[j]) dq.pop_back();
            dq.push_back(j);
        }
        while(!dq.empty() && dq.front() <= i) dq.pop_front();
        Ans = max(Ans, j - i + 1);
    }
    cout << Ans;
}

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