Submission #384208

#TimeUsernameProblemLanguageResultExecution timeMemory
384208kaplanbarUntitled (POI11_tem)C++14
0 / 100
1016 ms54764 KiB
#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;
    multiset<int> s;
    int ans = 0;
    for(int i = 0; i < n; i++) {
        j = max(j, i);
        while(j < n && (s.empty() || v[j].second >= -(*s.begin()))) {
            s.insert(-v[j].first);
            j++;
        }
        ans = max(ans, j - i);
        s.erase(-v[i].first);
    }

    cout << ans;

    return 0;
}
#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...