Submission #382074

#	Time	Username	Problem	Language	Result	Execution time	Memory
382074		vishesh312	Untitled (POI11_tem)	C++17	0 / 100	250 ms	11628 KiB

Main

#include "bits/stdc++.h"

#pragma GCC optimize("unroll-loops", "Ofast")

using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;

const int mxN = 1e6;
int mn[mxN], mx[mxN];

struct SegTree {
    int n;
    int t[2*mxN];
    void build() {
        for (int i = n-1; i > 0; --i) {
            t[i] = max(t[i*2], t[i*2+1]);
        }
    }
    int query(int l, int r) {
        int ret = -1e9;
        for (l += n, r += n; l < r; l /= 2, r /= 2) {
            if (l&1) ret = max(ret, t[l++]);
            if (r&1) ret = max(ret, t[--r]);
        }
        return ret;
    }
    SegTree(int _n) {
        n = _n;
        for (int i = 0; i < n; ++i) t[i+n] = mn[i];
    }
};

void solve(int tc) {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> mn[i] >> mx[i];
    }
    SegTree seg(n);
    int lo = 0, hi = n-1;
    int m = -1e9;
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        if (mx[i] < m) {
            ++lo;
            hi = i;
            while (lo < hi) {
                int mid = (lo + hi) / 2;
                int q = seg.query(mid, i);
                if (mx[i] < q) lo = mid+1;
                else hi = mid;
            }
            m = seg.query(lo, i);
        }
        m = max(m, mn[i]);
        ans = max(ans, i - lo + 1);
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 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