Submission #1168770

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168770		rayan_bd	Sequence (APIO23_sequence)	C++20	11 / 100	2096 ms	5644 KiB

sequence

#include <bits/stdc++.h>
using namespace std;

int sequence(int N, vector<int> A) {
    int peak = 0;
    
    for (int i = 1; i < N; i++) {
        if (A[i] < A[i - 1]) {
            peak = i - 1;
            break;
        }
    }

    int maxW = 0;


    for (int l = 0; l < N; l++) {
        unordered_map<int, int> freq;
        vector<int> sub;
        
        for (int r = l; r < N; r++) {
            sub.push_back(A[r]);
            freq[A[r]]++;
            
          
            vector<int> sorted_sub = sub;
            sort(sorted_sub.begin(), sorted_sub.end());
            int mid1 = sorted_sub[(sorted_sub.size() - 1) / 2];
            int mid2 = sorted_sub[sorted_sub.size() / 2];

            maxW = max(maxW, max(freq[mid1], freq[mid2]));
        }
    }

    return maxW;
}

• 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