如下暴力做法返回WA.
n = int(input())
a = list(map(int, input().split()))
ans = 1
for i in range(n):
for j in range(i, n):
if all(min(a[i], a[j]) > a[k] for k in range(i + 1, j)):
ans = max(ans, j - i + 1)
print(ans)
0 回复
0 转发
0 喜欢
39 阅读
