제출 #1196136

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1196136		Mousa_Aboubaker	Sequence (APIO23_sequence)	C++20	28 / 100	2096 ms	29740 KiB

sequence

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

#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

template <typename T>
using o_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

int sequence(int N, vector<int> A) {
  int mx = 0;
  for(int i = 0; i < N; i++)
  {
    o_set<int> x;
    vector<int> occ(N + 1, 0);
    for(int j = i; j < N; j++)
    {
      x.insert(A[j]);
      occ[A[j]]++;
      int med = *x.find_by_order((int)x.size() / 2);
      int med2 = med;
      if(!((int)x.size() & 1))
      {
        med2 = *x.find_by_order(((int)x.size() - 1) / 2);
      }
      mx = max(mx, occ[med]);
      mx = max(mx, occ[med2]);
    }
  }
  return mx;
}

• 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