Submission #384221

#	Time	Username	Problem	Language	Result	Execution time	Memory
384221		kaplanbar	Untitled (POI11_tem)	C++14	100 / 100	256 ms	31392 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    vector<pair<int,int>> v(n);

    for(int i = 0; i < n; i++) {
        cin >> v[i].first >> v[i].second;
    }

    int j = 0;
    queue<int> s;
    int ans = 0;
    for(int i = 0; i < n; i++) {
        j = max(j, i);
        while(j < n && (s.empty() || v[j].second >= v[s.front()].first)) {
            while(!s.empty() && v[s.front()].first <= v[j].first) s.pop();
            s.push(j);
            j++;
        }
        ans = max(ans, j - i);
        if(!s.empty() && s.front() == i) s.pop();
    }

    cout << ans;

    return 0;
}

• 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