제출 #119631

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
119631		popovicirobert	무제 (POI11_tem)	C++14	32 / 100	1063 ms	55036 KiB

Main

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

/*
const int MOD = ;

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}
*/

using namespace std;

const int MAXN = (int) 1e6;

int l[MAXN + 1], r[MAXN + 1];


int main() {
    //ifstream cin("B.in");
    //ofstream cout("B.out");
    int i, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n;

    for(i = 1; i <= n; i++) {
        cin >> l[i] >> r[i];
    }

    multiset <int> mst;
    int pos = 1, ans = 0;

    for(i = 1; i <= n; i++) {
        while(pos <= n && (mst.size() == 0 || *prev(mst.end()) <= r[pos])) {
            mst.insert(l[pos]);
            pos++;
        }
        ans = max(ans, pos - i);
        mst.erase(mst.find(l[i]));
    }

    cout << ans;

    //cin.close();
    //cout.close();
    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 8 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9