Submission #985153

#	Time	Username	Problem	Language	Result	Execution time	Memory
985153		CrazyBotBoy	Sequence (APIO23_sequence)	C++17	11 / 100	2035 ms	31148 KiB

sequence

#include "sequence.h"
#include <vector>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <cassert>

using namespace std;

int sequence(int N, vector<int> A) {
    int maxOccurrences = 0;

    for (int l = 0; l < N; ++l) {
        unordered_map<int, int> freq;
        priority_queue<int> maxHeap;
        priority_queue<int, vector<int>, greater<int>> minHeap;

        for (int r = l; r < N; ++r) {
            int num = A[r];
            if (maxHeap.empty() || num <= maxHeap.top()) {
                maxHeap.push(num);
            } else {
                minHeap.push(num);
            }

            if (maxHeap.size() > minHeap.size() + 1) {
                minHeap.push(maxHeap.top());
                maxHeap.pop();
            } else if (minHeap.size() > maxHeap.size()) {
                maxHeap.push(minHeap.top());
                minHeap.pop();
            }

            freq[num]++;

            int median1 = maxHeap.top();
            int median2 = minHeap.empty() ? median1 : minHeap.top();

            maxOccurrences = max(maxOccurrences, freq[median1]);
            if (median1 != median2) {
                maxOccurrences = max(maxOccurrences, freq[median2]);
            }
        }
    }

    return maxOccurrences;
}

• 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