Submission #1794906
Source Code Expand
import std.algorithm, std.conv, std.range, std.stdio, std.string; void main() { auto n = readln.chomp.to!int; auto h = new int[](n); foreach (i; 0..n) h[i] = readln.chomp.to!int; auto ans = 0, s = 0; foreach (i; 1..n-1) if (h[i-1] > h[i] && h[i] < h[i+1]) { ans = max(ans, i-s+1); s = i; } ans = max(ans, n-s); writeln(ans); }
Submission Info
Submission Time | |
---|---|
Task | B - 山のデータ |
User | tesh |
Language | D (DMD64 v2.070.1) |
Score | 100 |
Code Size | 382 Byte |
Status | AC |
Exec Time | 76 ms |
Memory | 4476 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 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 | 1 ms | 256 KB |
subtask0-sample-02.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | AC | 1 ms | 256 KB |
subtask1-03.txt | AC | 1 ms | 256 KB |
subtask1-04.txt | AC | 1 ms | 256 KB |
subtask1-05.txt | AC | 1 ms | 256 KB |
subtask1-06.txt | AC | 1 ms | 256 KB |
subtask1-07.txt | AC | 1 ms | 256 KB |
subtask1-08.txt | AC | 1 ms | 256 KB |
subtask1-09.txt | AC | 1 ms | 256 KB |
subtask1-10.txt | AC | 1 ms | 256 KB |
subtask1-11.txt | AC | 1 ms | 256 KB |
subtask1-12.txt | AC | 1 ms | 256 KB |
subtask1-13.txt | AC | 1 ms | 256 KB |
subtask1-14.txt | AC | 1 ms | 256 KB |
subtask1-15.txt | AC | 1 ms | 256 KB |
subtask2-01.txt | AC | 5 ms | 508 KB |
subtask2-02.txt | AC | 21 ms | 1532 KB |
subtask2-03.txt | AC | 38 ms | 1916 KB |
subtask2-04.txt | AC | 72 ms | 2428 KB |
subtask2-05.txt | AC | 73 ms | 4092 KB |
subtask2-06.txt | AC | 73 ms | 4476 KB |
subtask2-07.txt | AC | 75 ms | 2428 KB |
subtask2-08.txt | AC | 72 ms | 3324 KB |
subtask2-09.txt | AC | 73 ms | 3452 KB |
subtask2-10.txt | AC | 72 ms | 2428 KB |
subtask2-11.txt | AC | 75 ms | 4092 KB |
subtask2-12.txt | AC | 73 ms | 2428 KB |
subtask2-13.txt | AC | 75 ms | 2428 KB |
subtask2-14.txt | AC | 73 ms | 2428 KB |
subtask2-15.txt | AC | 76 ms | 2428 KB |