Submission #823729

#	Time	Username	Problem	Language	Result	Execution time	Memory
823729		hmm789	Sequence (APIO23_sequence)	C++17	28 / 100	2058 ms	34884 KiB

sequence

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

int sequence(int N, std::vector<int> A) {
    #define int long long
    int cnt[N+1], ans = 0;
    for(int i = 0; i < N; i++) {
        memset(cnt, 0, sizeof(cnt));
        multiset<int> l, r;
        for(int j = i; j < N; j++) {
            cnt[A[j]]++;
            if(r.empty() || A[j] <= *r.begin()) l.insert(A[j]);
            else r.insert(A[j]);
            if(l.size() > r.size()+1) {
                r.insert(*--l.end());
                l.erase(--l.end());
            }
            if(r.size() > l.size()) {
                l.insert(*r.begin());
                r.erase(r.begin());
            }
            if(l.size() == r.size()) {
                ans = max(ans, cnt[*--l.end()]);
                ans = max(ans, cnt[*r.begin()]);
            } else {
                ans = max(ans, cnt[*--l.end()]);
            }
        }
    }
    return ans;
    #undef int
}

• 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