제출 #896301

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
896301		Do_you_copy	무제 (POI11_tem)	C++17	100 / 100	588 ms	30032 KiB

Main

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

const int maxN = 1e6 + 10;
const int inf = 0x3f3f3f3f;
int a[maxN], b[maxN];

signed main(){
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i){
        cin >> a[i] >> b[i];
    }
    deque <int> Q;
    int i = 1, j = 0;
    b[n + 1] = -inf;
    int ans = 1;
    while (i <= n){
        while (!Q.empty() && Q.front() < i) Q.pop_front();
        if (j < i){
            j = i;
            Q.push_back(i);
        }
        while (j <= n && a[Q.front()] <= b[j + 1]){              
            ++j;
            while (!Q.empty() && a[Q.back()] <= a[j]) Q.pop_back();
            Q.push_back(j);

        }
        ans = max(ans, j - i + 1);
        ++i;
    }
    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