Submission #60982540

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
import bisect
n = int(input())
h = list(map(int, input().split()))
ans = 1
dp = [[1 for i in range(n)] for j in range(n)]
for i in range(n):
    dp[0][i] = 1
for i in range(n):
    for j in range(i + 1, n):
        if h[i] == h[j]:
            dp[j][j - i] += dp[i][j - i]
            ans = max(dp[j][j - i], ans)
print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import bisect

n = int(input())
h = list(map(int, input().split()))
ans = 1
dp = [[1 for i in range(n)] for j in range(n)]
for i in range(n):
    dp[0][i] = 1
for i in range(n):
    for j in range(i + 1, n):
        if h[i] == h[j]:
            dp[j][j - i] += dp[i][j - i]
            ans = max(dp[j][j - i], ans)
print(ans)

Submission Info

Judge Result