Submission #1178864

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178864		Agageldi	Sequence (APIO23_sequence)	C++20	0 / 100	38 ms	8260 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()

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

int sequence(int N, vector<int> A) {
  int cnt = 0;
  vis[A[N - 1]] = 1;
  for(int i = 0; i < N - 1; i++) {
    vis[A[i]]++;
    if(A[i] == A[i + 1]) cnt++;
    else {
      ans = max(ans,cnt + 1);
      cnt = 0;
    }
  }
  ans = max(ans,cnt + 1);
  for(int i = 0; i < N - 1; i++) {
    if(A[i] == A[i + 1]) vip[A[i]] = i + 1;
    else{
      if(vip[A[i + 1]]) {
        if(i - (vip[A[i + 1]] + 1) + 1 <= vis[A[i + 1]]) {
          ans = max(ans,vis[A[i + 1]]);
        }
      }
      vip[A[i]] = i;
    }
  }
  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