제출 #1196149

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1196149		Mousa_Aboubaker	Sequence (APIO23_sequence)	C++20	7 / 100	41 ms	10056 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;)
  {
    int j = i;
    while(j < N and A[j] == A[i])
      j++;
    mx = max(mx, j - i);
    i = j;
  }
  vector<int> in(N + 1, -1), out(N + 1, -1);
  vector<int> occ(N + 1, 0);
  for(int i = 0; i < N; i++)
  {
    if(in[A[i]] == -1)
      in[A[i]] = i;
    out[A[i]] = i;
    occ[A[i]]++;
  }
  for(int i = 1; i <= N; i++)
  {
    int idx = occ[i] - 1;
    idx += in[i];
    idx += N - out[i] - 1;
    if(idx >= (N - 1) / 2)
    {
      mx = max(mx, occ[i]);
    }
  }
  return mx;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 17
• Subtask 3: 7 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18