Submission #756837

#	Time	Username	Problem	Language	Result	Execution time	Memory
756837		doowey	Sequence (APIO23_sequence)	C++17	11 / 100	2083 ms	5896 KiB

sequence

#include "sequence.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

const int N = (int)5e5 + 10;
int cnt[N];

int sequence(int n, vector<int> a) {
    int ans = 0;
    for(int i = 0 ; i < n; i ++) {
        vector<int> me;
        for(int j = i ; j < n; j ++) {
            cnt[a[j]] ++ ;
            me.push_back(a[j]);
            sort(me.begin(), me.end());
            if(me.size() % 2 == 0){
                ans = max(ans, cnt[me[me.size() / 2]]);
                ans = max(ans, cnt[me[me.size() / 2 - 1]]);
            }
            else{
                ans = max(ans, cnt[me[me.size() / 2]]);
            }
        }
        for(auto x : me) cnt[x] = 0;
    }
    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