Submission #897518

#	Time	Username	Problem	Language	Result	Execution time	Memory
897518		vjudge1	Untitled (POI11_tem)	C++17	100 / 100	189 ms	30140 KiB

Main

#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using ll = long long;
const int maxN = 1e6 + 1;   

int a[maxN], b[maxN], n;
deque<int> q;

void ReadInput()
{
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
}

void Solve()
{
    b[n + 1] = -1e9 - 1;
    int res = 0, j = 0;
    for (int i = 1; i <= n; i++)
    {
        while(!q.empty() && q.front() < i)
            q.pop_front();

        if (j < i)
        {
            j = i;
            q.push_back(i);
        }

        while (j <= n && a[q.front()] <= b[j + 1])
        {
            j++;
            while (!q.empty() && a[q.back()] <= a[j])
                q.pop_back();
            q.push_back(j);
        }
        res = max(res, j - i + 1);
    }
    cout << res;
}

#define task ""
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(task".INP", "r", stdin);
    //freopen(task".OUT", "w", stdout);
    int T = 1;
    //cin >> T;
    while (T--)
    {
        ReadInput();
        Solve();
    }
}

• 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