제출 #1259797

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

sequence

#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;

int f(vector<int> lol)
{
  int n = lol.size();
  sort(lol.begin(),lol.end());
  if(lol.size() % 2 == 0)
  {
    int fi = lol[n / 2 - 1], se = lol[n / 2]; 
    return max(count(lol.begin(),lol.end(),fi), count(lol.begin(),lol.end(),se));
  }
  else
  {
    return count(lol.begin(),lol.end(), lol[n / 2]);
  }
}

int sequence(int n, std::vector<int> A) {
  int mx = -1;
  for(int i=0;i<n;++i)
  {
    vector<int> lol;
    for(int j=i;j<n;++j)
    {
      lol.push_back(A[j]);
      mx = max(mx, f(lol));
    }
  }
  return mx;
}

• 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