제출 #1168574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168574		rayan_bd	서열 (APIO23_sequence)	C++20	0 / 100	40 ms	10056 KiB

sequence

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

const double INF = 5e18;
const int mxN = 2e5+100;

#define fi first
#define se second
#define all(v) v.begin(), v.end()

int sequence(int N,vector<int> A){
	int cnt=1,best=1;
	vector<int> st(N+5,-1),en(N+5,-1),frq(N+5,0);
	st[A[0]]=en[A[0]]=0;
	frq[A[0]]=1;
	for(int i=1;i<N;++i){
		if(A[i]==A[i-1]) best=max(best,++cnt);
		else cnt=1;
		if(st[A[i]]==-1) st[A[i]]=i;
		en[A[i]]=i;
		++frq[A[i]];
	}

	for(auto it:A){
		int area=en[it]-st[it]+1;
		if((area+1)/2<=frq[it]) best=max(best,frq[it]);
	}

	return best;
}

• 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