제출 #1291506

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291506		dosts	서열 (APIO23_sequence)	C++17	11 / 100	2095 ms	4164 KiB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

signed sequence(signed N, std::vector<signed> A) {
  int ans = 0;
  for (int v = 1;v <= N;v++) {
    for (int l = 1;l<=N;l++) {
      int p = 0,s = 0,c = 0;
      for (int r = l;r<=N;r++) {
        if (A[r-1] < v) s++;
        if (A[r-1] > v) p++;
        if (A[r-1] == v) c++;
        if (2*max(p,s) <= r-l+1) {
          if (A[l-1] == v || A[r-1] == v) {
            ans = max(ans,c);
          }
        }
      }
    }
  }
  return ans;
}

• Subtask 1: 11 / 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