Submission #1736204


Source Code Expand

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


def main():
    N = int(input())
    h_list = []
    for _ in range(N):
        h_list.append(int(input()))

    left_down, right_down = [None] * N, [None] * N
    for i in range(N - 1, 0, -1):
        left_down[i] = h_list[i - 1] < h_list[i]
    for i in range(N - 1):
        right_down[i] = h_list[i] > h_list[i + 1]

    ans = 0
    for t in range(N):
        s, u = t, t
        for i in range(t, -1, -1):
            s = i
            if left_down[i] == 0:
                break
        for i in range(t, N):
            u = i
            if right_down[i] == 0:
                break
        ans = max(ans, u - s + 1)

    print(ans)


if __name__ == '__main__':
    main()

Submission Info

Submission Time
Task B - 山のデータ
User MitI_7
Language Python (3.4.3)
Score 30
Code Size 967 Byte
Status TLE
Exec Time 2109 ms
Memory 20092 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 2
AC × 17
AC × 23
TLE × 9
Set Name Test Cases
Sample subtask0-sample-01.txt, subtask0-sample-02.txt
Subtask1 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt
Subtask2 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt
Case Name Status Exec Time Memory
subtask0-sample-01.txt AC 21 ms 3316 KB
subtask0-sample-02.txt AC 21 ms 3316 KB
subtask1-01.txt AC 21 ms 3316 KB
subtask1-02.txt AC 21 ms 3316 KB
subtask1-03.txt AC 22 ms 3316 KB
subtask1-04.txt AC 21 ms 3316 KB
subtask1-05.txt AC 21 ms 3316 KB
subtask1-06.txt AC 22 ms 3316 KB
subtask1-07.txt AC 21 ms 3316 KB
subtask1-08.txt AC 21 ms 3316 KB
subtask1-09.txt AC 21 ms 3316 KB
subtask1-10.txt AC 21 ms 3316 KB
subtask1-11.txt AC 22 ms 3316 KB
subtask1-12.txt AC 22 ms 3316 KB
subtask1-13.txt AC 22 ms 3316 KB
subtask1-14.txt AC 22 ms 3316 KB
subtask1-15.txt AC 22 ms 3316 KB
subtask2-01.txt AC 66 ms 4212 KB
subtask2-02.txt AC 259 ms 7808 KB
subtask2-03.txt TLE 2104 ms 11780 KB
subtask2-04.txt TLE 2105 ms 19968 KB
subtask2-05.txt TLE 2105 ms 19968 KB
subtask2-06.txt TLE 2109 ms 19964 KB
subtask2-07.txt AC 870 ms 19968 KB
subtask2-08.txt TLE 2105 ms 20092 KB
subtask2-09.txt TLE 2105 ms 19968 KB
subtask2-10.txt TLE 2105 ms 19968 KB
subtask2-11.txt AC 912 ms 19968 KB
subtask2-12.txt TLE 2105 ms 19968 KB
subtask2-13.txt AC 880 ms 19968 KB
subtask2-14.txt TLE 2105 ms 19968 KB
subtask2-15.txt AC 875 ms 19968 KB