Submission #1736253
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())) ans = 0 for t in range(N): if t == 0 or t == N - 1 or h_list[-1] < h_list[t] > h_list[t + 1]: s, u = t, t for i in range(t, -1, -1): s = i if i - 1 >= 0 and h_list[i - 1] > h_list[i]: break for i in range(t, N): u = i if i + 1 < N and h_list[i] < h_list[i + 1]: 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 | 0 |
Code Size | 911 Byte |
Status | WA |
Exec Time | 2104 ms |
Memory | 15352 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 70 | ||||||||||||
Status |
|
|
|
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 | 21 ms | 3316 KB |
subtask1-04.txt | AC | 22 ms | 3316 KB |
subtask1-05.txt | AC | 22 ms | 3316 KB |
subtask1-06.txt | AC | 21 ms | 3316 KB |
subtask1-07.txt | AC | 21 ms | 3316 KB |
subtask1-08.txt | AC | 22 ms | 3316 KB |
subtask1-09.txt | AC | 22 ms | 3316 KB |
subtask1-10.txt | AC | 22 ms | 3316 KB |
subtask1-11.txt | AC | 22 ms | 3316 KB |
subtask1-12.txt | AC | 22 ms | 3316 KB |
subtask1-13.txt | WA | 22 ms | 3316 KB |
subtask1-14.txt | AC | 22 ms | 3316 KB |
subtask1-15.txt | AC | 22 ms | 3316 KB |
subtask2-01.txt | AC | 58 ms | 3948 KB |
subtask2-02.txt | AC | 221 ms | 6648 KB |
subtask2-03.txt | AC | 284 ms | 9336 KB |
subtask2-04.txt | TLE | 2104 ms | 15352 KB |
subtask2-05.txt | TLE | 2104 ms | 15352 KB |
subtask2-06.txt | TLE | 2104 ms | 15352 KB |
subtask2-07.txt | AC | 616 ms | 15352 KB |
subtask2-08.txt | AC | 581 ms | 15352 KB |
subtask2-09.txt | TLE | 2104 ms | 15352 KB |
subtask2-10.txt | TLE | 2104 ms | 15352 KB |
subtask2-11.txt | AC | 694 ms | 15352 KB |
subtask2-12.txt | TLE | 2104 ms | 15352 KB |
subtask2-13.txt | AC | 578 ms | 15352 KB |
subtask2-14.txt | TLE | 2104 ms | 15352 KB |
subtask2-15.txt | AC | 577 ms | 15352 KB |