제출 #951684

#제출 시각아이디문제언어결과실행 시간메모리
951684vjudge1Untitled (POI11_tem)C++17
66 / 100
175 ms38632 KiB
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int maxN = 1e6 + 5;

int n;
int a[maxN], b[maxN];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    //freopen("A.INP", "r", stdin);
    //freopen("A.OUT", "w", stdout);

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
    }
    deque<int> dq;
    int res = 1;
    int ind = 0;
    for (int i = 1; i <= n; i++) {
        while (!dq.empty() && a[dq.front()] > b[i]) {
            ind++;
            if (dq.front() == ind) {
                dq.pop_front();
            }
        }
        while (!dq.empty() && a[dq.back()] < a[i]) {
            dq.pop_back();
        }
        dq.push_back(i);
        res = max(res, i - ind);
    }
    cout << res;
}
#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...