Submission #985203

#	Time	Username	Problem	Language	Result	Execution time	Memory
985203		CrazyBotBoy	Sequence (APIO23_sequence)	C++17	28 / 100	2061 ms	49140 KiB

sequence

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

using namespace std;

int sequence(int N, vector<int> A) {
    int maxOccurrences = 0;
    
    // Iterate over each possible starting point of the subarray
    for (int l = 0; l < N; ++l) {
        unordered_map<int, int> freq;
        multiset<int> minHeap, maxHeap;
        
        for (int r = l; r < N; ++r) {
            int num = A[r];
            
            if (maxHeap.empty() || num <= *maxHeap.rbegin()) {
                maxHeap.insert(num);
            } else {
                minHeap.insert(num);
            }
            
            if (maxHeap.size() > minHeap.size() + 1) {
                minHeap.insert(*maxHeap.rbegin());
                maxHeap.erase(--maxHeap.end());
            } else if (minHeap.size() > maxHeap.size()) {
                maxHeap.insert(*minHeap.begin());
                minHeap.erase(minHeap.begin());
            }
            
            freq[num]++;
            
            int median1 = *maxHeap.rbegin();
            int median2 = (maxHeap.size() + minHeap.size()) % 2 == 0 ? *minHeap.begin() : median1;
            
            maxOccurrences = max(maxOccurrences, freq[median1]);
            if (median1 != median2) {
                maxOccurrences = max(maxOccurrences, freq[median2]);
            }
        }
    }

    return maxOccurrences;
}

• 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