Submission #985210

#	Time	Username	Problem	Language	Result	Execution time	Memory
985210		CrazyBotBoy	Sequence (APIO23_sequence)	C++17	0 / 100	2080 ms	25536 KiB

sequence

#include "sequence.h"
#include <vector>
#include <unordered_map>

int sequence(int N, std::vector<int> A) {
  int max_median_count = 0;
  // Iterate through all subarrays
  for (int l = 0; l < N; ++l) {
    std::unordered_map<int, int> count;
    for (int r = l; r < N; ++r) {
      // Update count for the current element
      count[A[r]]++;
      int num = A[r];

      // Check if the current element can be a median (early termination)
      if (count[num] <= max_median_count) {
        continue;
      }

      int half_length = (r - l + 1) / 2;
      if (count[num] >= half_length && count[num] <= half_length + 1) {
        max_median_count = std::max(max_median_count, count[num]);
      }
    }
  }

  return max_median_count;
}

• Subtask 1: 0 / 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