Submission #981902

#	Time	Username	Problem	Language	Result	Execution time	Memory
981902		vjudge1	Sequence (APIO23_sequence)	C++17	28 / 100	2071 ms	31856 KiB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;
using ii = pair <ll, ll>;
using vii = vector <ii>;

int sequence (int n, vi ve) {
    for (int &i : ve) i--;
    ll ans = 0;
    for (ll l = 0; l < n; l++) {
        multiset <ll, greater <ll> > st1; // big to small (mid...0)
        multiset <ll> st2; // small to big (mid...n)
        vll freq(n, 0);
        for (ll r = l; r < n; r++) {
            ll mid = (st2.size() ? *st2.begin() : 0);
            freq[ve[r]]++;
            if (ve[r] >= mid) st2.insert(ve[r]);
            else st1.insert(ve[r]);
            while (st2.size() > st1.size()) {
                st1.insert(*st2.begin());
                st2.erase(st2.begin());
            }
            while (st1.size() > st2.size()) {
                st2.insert(*st1.begin());
                st1.erase(st1.begin());
            }
            if (st1.size() == st2.size()) { // two medians
                ll med1 = *st1.begin();
                ll med2 = *st2.begin();
                ans = max(ans, freq[med1]);
                ans = max(ans, freq[med2]);
            } else { // one median
                assert(st2.size() > st1.size());
                ll med = *st2.begin();
                ans = max(ans, freq[med]);
            }
        }
    }
    return int(ans);
}

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