Submission #3477764
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; int a[300010] = {}; for (int i = 0; i < n; i++) cin >> a[i]; int l = 0, f = 1, ans = 0; for (int i = 0; i < n; i++) { if (f == 1) { if (a[i + 1] < a[i]) f = -1; } else { if (a[i + 1] > a[i]) { f = 1; ans = max(ans, i - l + 1); l = i; } } } cout << max(ans, n - l) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 山のデータ |
User | xuelei |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 456 Byte |
Status | AC |
Exec Time | 158 ms |
Memory | 1408 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 | 2 ms | 1408 KB |
subtask0-sample-02.txt | AC | 2 ms | 1408 KB |
subtask1-01.txt | AC | 2 ms | 1408 KB |
subtask1-02.txt | AC | 2 ms | 1408 KB |
subtask1-03.txt | AC | 2 ms | 1408 KB |
subtask1-04.txt | AC | 2 ms | 1408 KB |
subtask1-05.txt | AC | 2 ms | 1408 KB |
subtask1-06.txt | AC | 2 ms | 1408 KB |
subtask1-07.txt | AC | 2 ms | 1408 KB |
subtask1-08.txt | AC | 2 ms | 1408 KB |
subtask1-09.txt | AC | 2 ms | 1408 KB |
subtask1-10.txt | AC | 2 ms | 1408 KB |
subtask1-11.txt | AC | 2 ms | 1408 KB |
subtask1-12.txt | AC | 2 ms | 1408 KB |
subtask1-13.txt | AC | 2 ms | 1408 KB |
subtask1-14.txt | AC | 2 ms | 1408 KB |
subtask1-15.txt | AC | 2 ms | 1408 KB |
subtask2-01.txt | AC | 10 ms | 1408 KB |
subtask2-02.txt | AC | 42 ms | 1408 KB |
subtask2-03.txt | AC | 78 ms | 1408 KB |
subtask2-04.txt | AC | 153 ms | 1408 KB |
subtask2-05.txt | AC | 156 ms | 1408 KB |
subtask2-06.txt | AC | 153 ms | 1408 KB |
subtask2-07.txt | AC | 157 ms | 1408 KB |
subtask2-08.txt | AC | 153 ms | 1408 KB |
subtask2-09.txt | AC | 153 ms | 1408 KB |
subtask2-10.txt | AC | 156 ms | 1408 KB |
subtask2-11.txt | AC | 154 ms | 1408 KB |
subtask2-12.txt | AC | 158 ms | 1408 KB |
subtask2-13.txt | AC | 154 ms | 1408 KB |
subtask2-14.txt | AC | 156 ms | 1408 KB |
subtask2-15.txt | AC | 157 ms | 1408 KB |