QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #576136 | #9313. Make Max | HowieHz | TL | 14ms | 10628kb | Python3 | 797b | 2024-09-19 18:44:12 | 2024-09-19 18:44:12 |
Judging History
answer
c = int(input())
while c > 0:
rt = 0
c -= 1
n = int(input())
index_max = n - 1
l = list(map(int, input().split()))
if min(l) == max(l):
print(0)
continue
for i, e in enumerate(l):
l_step = 0
r_step = 0
l_max_number = e
r_max_number = e
for l_number in l[i::-1]:
if l_number > l_max_number:
l_max_number = l_number
l_step += 1
if l_number < l_max_number:
break
for r_number in l[i + 1 :]:
if r_number > r_max_number:
r_max_number = r_number
r_step += 1
if r_number < r_max_number:
break
rt += l_step + r_step
print(rt)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 14ms
memory: 10628kb
input:
4 2 1 2 2 2 2 7 1 1 1 2 2 2 2 3 1 2 3
output:
1 0 3 3
result:
ok 4 number(s): "1 0 3 3"
Test #2:
score: -100
Time Limit Exceeded
input:
2 198018 875421126 585870339 471894633 383529988 625397685 944061047 704695631 105113224 459022561 760848605 980735314 847376362 980571959 329939331 644635272 326439858 752879510 837384394 175179068 182094523 397239381 1199016 185143405 279638454 252374970 822030887 860312140 137248166 993229443 164...