Submission #7281481


Source Code Expand

import numpy as np
N = int(input())
A = np.array(input().split(), dtype=np.int32)

"""
A = [10,4,8,7,3]
left_idx = [0,0,2,2,2]
というものを作る
"""
left_idx = np.arange(N) # [0,1,2,3,4]
left_idx[1:][A[:-1] >= A[1:]] = 0 # [0,0,2,0,0] (自身が左以下ならば0に)
np.maximum.accumulate(left_idx, out=left_idx) # [0,0,2,2,2]

answer = (np.arange(N) - left_idx).max()
print(answer)

Submission Info

Submission Time
Task C - Lower
User maspy
Language Python (3.4.3)
Score 300
Code Size 409 Byte
Status AC
Exec Time 175 ms
Memory 24256 KiB

Judge Result

Set Name All Sample
Score / Max Score 300 / 300 0 / 0
Status
AC × 18
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 146 ms 12396 KiB
sample_02 AC 147 ms 12396 KiB
sample_03 AC 147 ms 12392 KiB
testcase_01 AC 163 ms 18960 KiB
testcase_02 AC 175 ms 23448 KiB
testcase_03 AC 173 ms 22744 KiB
testcase_04 AC 148 ms 12396 KiB
testcase_05 AC 149 ms 13148 KiB
testcase_06 AC 162 ms 18700 KiB
testcase_07 AC 170 ms 21560 KiB
testcase_08 AC 173 ms 23468 KiB
testcase_09 AC 147 ms 12424 KiB
testcase_10 AC 174 ms 23396 KiB
testcase_11 AC 175 ms 24256 KiB
testcase_12 AC 164 ms 14920 KiB
testcase_13 AC 149 ms 12392 KiB
testcase_14 AC 173 ms 21852 KiB
testcase_15 AC 174 ms 21880 KiB