Submission #31375521

Source Code Expand

n = int(input())
a = list(map(int, input().split()))
answer = 1
for i in range(n):
    for j in range(i + 1, n):
        if a[j - 1] > a[j]:
            break
        answer = max(answer, j - i + 1)
print(answer)

Submission Info

Submission Time
Task C - 最長昇順連続部分列 (Longest Ascending Contiguous Subsequence)
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 100
Code Size 220 Byte
Status AC
Exec Time 65 ms
Memory 64344 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 23
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 65 ms 61724 KiB
01-02.txt AC 54 ms 61544 KiB
01-03.txt AC 48 ms 61872 KiB
01-04.txt AC 50 ms 61916 KiB
01-05.txt AC 49 ms 61592 KiB
01-06.txt AC 47 ms 61772 KiB
01-07.txt AC 49 ms 62068 KiB
01-08.txt AC 49 ms 61812 KiB
01-09.txt AC 53 ms 63388 KiB
01-10.txt AC 50 ms 61792 KiB
01-11.txt AC 47 ms 61704 KiB
01-12.txt AC 53 ms 63548 KiB
01-13.txt AC 53 ms 64344 KiB
01-14.txt AC 47 ms 61612 KiB
01-15.txt AC 50 ms 64312 KiB
01-16.txt AC 53 ms 62000 KiB
01-17.txt AC 50 ms 63628 KiB
01-18.txt AC 49 ms 63544 KiB
01-19.txt AC 48 ms 61756 KiB
01-20.txt AC 49 ms 61748 KiB
sample-01.txt AC 50 ms 61568 KiB
sample-02.txt AC 50 ms 61712 KiB
sample-03.txt AC 52 ms 61760 KiB