Submission #1178855

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178855		Agageldi	Sequence (APIO23_sequence)	C++20	0 / 100	45 ms	8008 KiB

sequence

#include "bits/stdc++.h"
#include "sequence.h"
// #include "grader.cpp"
using namespace std;

#define MAX_N 5000005
#define ll long long
#define SZ(v) (int)v.size()

ll a[MAX_N], n, ans, jogap = -1, tr = 0;
vector <int> v;

int sequence(int N, vector<int> A) {
  ans = 1;
  for(int i = 0; i < N; i++) {
    v.clear();
    for(int j = i; j < min(N,i + 4); j++) {
      a[A[j]]++;
      v.push_back(A[j]);
      int ind = SZ(v) - 1,mid = SZ(v) / 2;
      while(ind > 0 && v[ind] < v[ind - 1]) {
        swap(v[ind],v[ind - 1]);
        ind--;
      }
      ans = max({ans,a[v[mid]],a[v[mid - ((j - i + 1) % 2 == 0)]]});
    }
    for(int j = i; j<min(N,i + 4); j++) {
      a[A[j]]--;
    }
  }
  return ans;
}

• 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