Submission #3379425
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main(){ long long n,ans=1; cin >> n; long long a[n]; for(int i=0;i<n;i++){ cin >> a[i]; } int l=0; bool down=true; for(int t=0;t<n;t++){ if(a[t]<a[t+1]){//西側 if(down){//以前に下っていた? ans=max(ans,t-l+1LL); l=t; down=false; } }else{//東側 down=true; } } ans=max(ans,n-l); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 山のデータ |
User | MATSUMAT |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 481 Byte |
Status | AC |
Exec Time | 118 ms |
Memory | 2560 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 | 7 ms | 384 KB |
subtask2-02.txt | AC | 32 ms | 896 KB |
subtask2-03.txt | AC | 59 ms | 1408 KB |
subtask2-04.txt | AC | 116 ms | 2560 KB |
subtask2-05.txt | AC | 116 ms | 2560 KB |
subtask2-06.txt | AC | 116 ms | 2560 KB |
subtask2-07.txt | AC | 117 ms | 2560 KB |
subtask2-08.txt | AC | 116 ms | 2560 KB |
subtask2-09.txt | AC | 116 ms | 2560 KB |
subtask2-10.txt | AC | 116 ms | 2560 KB |
subtask2-11.txt | AC | 116 ms | 2560 KB |
subtask2-12.txt | AC | 116 ms | 2560 KB |
subtask2-13.txt | AC | 116 ms | 2560 KB |
subtask2-14.txt | AC | 116 ms | 2560 KB |
subtask2-15.txt | AC | 118 ms | 2560 KB |