Submission #999875

#	Time	Username	Problem	Language	Result	Execution time	Memory
999875		vjudge1	Untitled (POI11_tem)	C++17	100 / 100	160 ms	29756 KiB

Main

    #include <bits/stdc++.h>
     
    using namespace std;
     
    const int maxN = 1e6 + 5;
     
    int n;
    int a[maxN], b[maxN];
     
    int main() {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
     
     
        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;
    }

• 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