提出 #57850582

---

ソースコード 拡げる

import sys
from collections import deque


def debug(*args):
    print(*args, file=sys.stderr)


n = int(input())
a = list(map(int, input().split()))

appear = [deque([]) for _ in range(n+1)]
for i, ai in enumerate(a):
    appear[ai].append(i)

# i = 0 に対する和を求める
ans = 0
element_count = 0
for j in range(n):
    if j <= appear[a[j]][0]:
        element_count += 1
    ans += element_count

g_pre = ans

for i in range(1, n):
    appear[a[i-1]].popleft()
    if len(appear[a[i-1]]) == 0:
        g = g_pre - n + i - 1
    else:
        first_idx = appear[a[i-1]][0]
        g = g_pre - first_idx + i - 1
    ans += g
    g_pre = g

print(ans)

提出情報

ジャッジ結果