Submission #976261

#	Time	Username	Problem	Language	Result	Execution time	Memory
976261		josanneo22	Sequence (APIO23_sequence)	C++17	28 / 100	2067 ms	31808 KiB

sequence

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

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

int sequence(int N, std::vector<int> a) {
  int ans = 0;
  for (int i = 0; i < N; i++) {
    priority_queue<int> front;
    priority_queue<int, vector<int>, greater<int>> back;
    map<int, int> cnt;
    for (int j = i; j < N; j++) {
      front.push(a[j]);
      cnt[a[j]]++;
      while (front.size() - back.size() >= 2) {
        back.push(front.top());
        front.pop();
      }
      while (back.size() && front.top() > back.top()) {
        int A = front.top(); front.pop();
        int B = back.top(); back.pop();
        back.push(A); front.push(B);
      }
      if (front.size() == back.size()) {
        int m1 = front.top();
        int m2 = back.top();
        ans = max(ans, cnt[m1]);
        ans = max(ans, cnt[m2]);
      }
      else {
        int m1 = front.top();
        ans = max(ans, cnt[m1]);
      }
    }
  }
  return ans;
}

// #include "grader.cpp"

• 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