Submission #60058061

---

Source Code Expand

from collections import deque, defaultdict, Counter
from math import ceil
from bisect import *
from heapq import *
import sys

def input():
    return sys.stdin.readline().strip()

def ri():
    return int(input())

def rri():
    return map(int, input().split())

inf = float("inf")
MOD = 998244353
N = ri()
A = list(rri())
i = 0
j = 0
ans = 0
cnt = Counter()
while i < N:
    j = i
    while j + 1 < N and A[j] == A[j + 1] and cnt[A[j]] + 1 <= 2 and cnt[A[j + 1]] + 1 <= 2:
        cnt[A[j]] += 1
        cnt[A[j + 1]] += 1
        j += 2
    ans = max(ans, j - i)
    i = j + 2
i = 1
j = 1
cnt = Counter()
while i < N:
    j = i
    while j + 1 < N and A[j] == A[j + 1] and cnt[A[j]] + 1 <= 2 and cnt[A[j + 1]] + 1 <= 2:
        cnt[A[j]] += 1
        cnt[A[j + 1]] += 1
        j += 2
    ans = max(ans, j - i)
    i = j + 2
print(ans)

Submission Info

Judge Result