제출 #1189398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1189398		Thanhs	서열 (APIO23_sequence)	C++20	11 / 100	2094 ms	10320 KiB

sequence

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define endl '\n'
#define setmin(x, y) x = min((x), (y))
#define setmax(x, y) x = max((x), (y))
#define sqr(x) ((x) * (x))
#define all(x) x.begin(), x.end()

int sequence(int N, vector<int> A)
{
    int ans = 0;
    vector<int> c(N + 1);
    vector<bool> b(N + 1);
    for (int i = 0; i < N; i++)
    {
        priority_queue<int> L;
        priority_queue<int, vector<int>, greater<>> R;
        for (int j = i; j < N; j++)
        {
            c[A[j]]++;
            if (L.empty() || A[j] <= L.top())
                L.push(A[j]);
            else
                R.push(A[j]);
            if (L.size() > R.size() + 1)
                R.push(L.top()), L.pop();
            if (R.size() > L.size() + 1)
                L.push(R.top()), R.pop();
            int res = 0;
            if (L.size() >= R.size())
                setmax(res, c[L.top()]);
            if (R.size() >= L.size())
                setmax(res, c[R.top()]);
            b[res] = 1;
            setmax(ans, res);
        }
        for (int j = i; j < N; j++)
            c[A[j]]--;
    }
    for (int i = 1; i <= ans; i++)
        assert(b[i]);
    return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 17
• Subtask 3: 0 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18