Submission #2168694
Source Code Expand
N = gets.to_i hs = Array.new(N) { gets.to_i } ans = 1 d1 = 0 s = 0 (N - 1).times do |i| d2 = (hs[i + 1] <=> hs[i]) if d1 < 0 && d2 > 0 ans = [ans, i - s + 1].max s = i end d1 = d2 end puts [ans, N - s].max
Submission Info
Submission Time | |
---|---|
Task | B - 山のデータ |
User | nejiko96 |
Language | Ruby (2.3.3) |
Score | 100 |
Code Size | 224 Byte |
Status | AC |
Exec Time | 229 ms |
Memory | 6396 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 | 7 ms | 1788 KB |
subtask0-sample-02.txt | AC | 7 ms | 1788 KB |
subtask1-01.txt | AC | 7 ms | 1788 KB |
subtask1-02.txt | AC | 7 ms | 1788 KB |
subtask1-03.txt | AC | 7 ms | 1788 KB |
subtask1-04.txt | AC | 7 ms | 1788 KB |
subtask1-05.txt | AC | 7 ms | 1788 KB |
subtask1-06.txt | AC | 7 ms | 1788 KB |
subtask1-07.txt | AC | 7 ms | 1788 KB |
subtask1-08.txt | AC | 7 ms | 1788 KB |
subtask1-09.txt | AC | 7 ms | 1788 KB |
subtask1-10.txt | AC | 7 ms | 1788 KB |
subtask1-11.txt | AC | 7 ms | 1788 KB |
subtask1-12.txt | AC | 7 ms | 1788 KB |
subtask1-13.txt | AC | 7 ms | 1788 KB |
subtask1-14.txt | AC | 7 ms | 1788 KB |
subtask1-15.txt | AC | 7 ms | 1788 KB |
subtask2-01.txt | AC | 19 ms | 2172 KB |
subtask2-02.txt | AC | 65 ms | 2684 KB |
subtask2-03.txt | AC | 105 ms | 3196 KB |
subtask2-04.txt | AC | 185 ms | 4348 KB |
subtask2-05.txt | AC | 185 ms | 6396 KB |
subtask2-06.txt | AC | 189 ms | 4476 KB |
subtask2-07.txt | AC | 229 ms | 4348 KB |
subtask2-08.txt | AC | 184 ms | 4348 KB |
subtask2-09.txt | AC | 186 ms | 4348 KB |
subtask2-10.txt | AC | 184 ms | 4476 KB |
subtask2-11.txt | AC | 218 ms | 4348 KB |
subtask2-12.txt | AC | 189 ms | 4348 KB |
subtask2-13.txt | AC | 219 ms | 4476 KB |
subtask2-14.txt | AC | 184 ms | 4348 KB |
subtask2-15.txt | AC | 222 ms | 4348 KB |