제출 #1357540

#제출 시각아이디문제언어결과실행 시간메모리
1357540Megalosaurus서열 (APIO23_sequence)C++20
11 / 100
2096 ms6192 KiB
#include <bits/stdc++.h>
#include "sequence.h"

#define ll long long

using namespace std;


int sequence(int N, std::vector<int> A) {
	int ans = 1;
	for(int i = 0; i < N; i++)
	{
		map<int,int>mp;
		for(int j = i; j < N; j++)
		{
			mp[A[j]]++;
			int len = j-i+1, cur = 0;
			vector<int>med;
			for(auto [val, freq]:mp)
			{
				cur += freq;
				int h = min(cur, len/2);
				if(h >= (len+1)/2) med.push_back(val);
				if(cur > len/2+1) break;
			}
			for(auto it:med)
			{
				// cout << i << ' ' << j << ' ' << it << ' ' << mp[it] << "\n";
				ans = max(ans, mp[it]);
			}
		}
		
	}
  return ans;
}
#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...