187282025-11-01 11:58:47VizsimiVölgy (100 pont)python3Time limit exceeded 20/100300ms7152 KiB
measure = int(input())
vallys = []
lengths = []

for h in range(0, measure):
  vallys.append(int(input())) 

for i in range(0, measure):
  for j in range(measure - 1, i, -1):
    for k in range(i + 1, j):
      if vallys[k] >= vallys[i] or vallys[k] >= vallys[j]:
        break
    if k + 1 == j: 
      lengths.append(j - i)
      break
  if lengths and lengths[0] >= measure / 2:
    break
biggest = lengths[0]
for m in lengths:
  if m > biggest:
    biggest = m
print(biggest)
SubtaskSumTestVerdictTimeMemory
base20/100
1Accepted0/016ms3112 KiB
2Time limit exceeded0/0282ms3140 KiB
3Wrong answer0/516ms3124 KiB
4Accepted5/516ms3116 KiB
5Accepted5/516ms3056 KiB
6Accepted5/518ms3136 KiB
7Wrong answer0/517ms3116 KiB
8Accepted5/518ms3140 KiB
9Time limit exceeded0/5300ms3132 KiB
10Time limit exceeded0/5300ms3124 KiB
11Time limit exceeded0/5300ms3140 KiB
12Time limit exceeded0/5280ms3128 KiB
13Time limit exceeded0/5289ms3428 KiB
14Time limit exceeded0/5289ms3380 KiB
15Time limit exceeded0/5300ms7004 KiB
16Time limit exceeded0/5280ms7128 KiB
17Time limit exceeded0/5289ms7100 KiB
18Time limit exceeded0/5289ms7152 KiB
19Time limit exceeded0/5300ms6916 KiB
20Time limit exceeded0/5287ms6916 KiB
21Time limit exceeded0/5287ms6916 KiB
22Time limit exceeded0/5287ms7152 KiB