Submission #1178885

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178885		Muhammet	Sequence (APIO23_sequence)	C++17	28 / 100	2097 ms	51276 KiB

sequence

#include "bits/stdc++.h"
#include "sequence.h"
// #include "grader.cpp"

using namespace std;

#define SZ(s) (int)s.size()

map <int, int> vis;

int sequence(int n, vector<int> a) {
    int ans = 0;
    for(int i = 0; i < n; i++) {
        vis.clear();
        multiset <int> s, s1;
        for(int j = i; j < n; j++) {
            s.insert(a[j]);
            vis[a[j]]++;
            while((SZ(s) and SZ(s1) and *s.rbegin() > *s1.begin()) or (!SZ(s1))) {
                s1.insert(*s.rbegin());
                s.erase(--s.end());
            }
            while(SZ(s) < SZ(s1)) {
                s.insert(*s1.begin());
                s1.erase(s1.begin());
            }
            while(SZ(s) - 1 >= SZ(s1) + 1) {
                s1.insert(*s.rbegin());
                s.erase(--s.end());
            }
            ans = max(ans, vis[*s.rbegin()]);
            if(SZ(s) == SZ(s1)) ans = max(ans, vis[*s1.begin()]);
        }
    }

    return 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