Submission #985141

# Submission time Handle Problem Language Result Execution time Memory
985141 2024-05-17T11:23:34 Z CrazyBotBoy Cyberland (APIO23_cyberland) C++17
Compilation error
0 ms 0 KB
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <iostream>

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;
        vector<int> subarray;
        
        for (int r = l; r < N; ++r) {
            subarray.push_back(A[r]);
            freq[A[r]]++;
            
            vector<int> temp = subarray;
            sort(temp.begin(), temp.end());
            int k = temp.size();
            int median1 = temp[(k - 1) / 2];
            int median2 = temp[k / 2];
            
            maxOccurrences = max(maxOccurrences, freq[median1]);
            if (median1 != median2) {
                maxOccurrences = max(maxOccurrences, freq[median2]);
            }
        }
    }
    
    return maxOccurrences;
}

Compilation message

/usr/bin/ld: /tmp/ccOEbcgD.o: in function `main':
grader.cpp:(.text.startup+0x696): undefined reference to `solve(int, int, int, int, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status