Submission #1200983

#TimeUsernameProblemLanguageResultExecution timeMemory
1200983aykhnSequence (APIO23_sequence)C++20
11 / 100
2096 ms4168 KiB
#include "sequence.h"
#include <bits/stdc++.h>

using namespace std;

int sequence(int N, vector<int> A)
{
  int res = 0;
  for (int val = 1; val <= N; val++)
  {
    for (int l = 0; l < N; l++)
    {
      int a = 0, x = 0, y = 0;
      for (int r = l; r < N; r++)
      {
        if (A[r] == val) a++;
        else if (A[r] < val) x++;
        else y++;
        if (a >= (x - y) && a >= (y - x)) res = max(res, a);
      }
    }
  }
  return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...