Submission #2174986
Source Code Expand
#include<vector> #include<iostream> #include<string> #include<algorithm> #include<math.h> #include<map> #include<functional> #include<queue> #include<stack> #include<string.h> #include<list> #include<limits> #include<bitset> #include<ctype.h> #include<set> using namespace std; typedef long long int ll; typedef pair<int,int> P; const ll MOD=10007; const ll INF=1000000000; const int MAX=100001; const double EPS=0.00001; int main(){ int n; cin>>n; int h[300001]; for(int i=0;i<n;i++){ cin>>h[i]; } int ans=0; int f[300001],b[300001]; f[0]=0; b[n-1]=0; for(int i=1;i<n;i++){ if(h[i]>h[i-1]){ f[i]=f[i-1]+1; }else{ f[i]=0; } } for(int i=0;i<n-1;i++){ if(h[n-i-2]>h[n-i-1]){ b[n-i-2]=b[n-i-1]+1; }else{ b[n-i-2]=0; } } for(int i=0;i<n;i++){ ans=max(ans,b[i]+f[i]+1); } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 山のデータ |
User | TAISA_ |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1045 Byte |
Status | AC |
Exec Time | 159 ms |
Memory | 3712 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 | 2304 KB |
subtask0-sample-02.txt | AC | 1 ms | 256 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | AC | 2 ms | 2304 KB |
subtask1-03.txt | AC | 2 ms | 2304 KB |
subtask1-04.txt | AC | 2 ms | 2304 KB |
subtask1-05.txt | AC | 2 ms | 2304 KB |
subtask1-06.txt | AC | 1 ms | 256 KB |
subtask1-07.txt | AC | 2 ms | 2304 KB |
subtask1-08.txt | AC | 2 ms | 2304 KB |
subtask1-09.txt | AC | 2 ms | 2304 KB |
subtask1-10.txt | AC | 2 ms | 2304 KB |
subtask1-11.txt | AC | 2 ms | 2304 KB |
subtask1-12.txt | AC | 2 ms | 2304 KB |
subtask1-13.txt | AC | 2 ms | 2304 KB |
subtask1-14.txt | AC | 1 ms | 256 KB |
subtask1-15.txt | AC | 2 ms | 2304 KB |
subtask2-01.txt | AC | 10 ms | 2304 KB |
subtask2-02.txt | AC | 43 ms | 2816 KB |
subtask2-03.txt | AC | 80 ms | 3072 KB |
subtask2-04.txt | AC | 155 ms | 3712 KB |
subtask2-05.txt | AC | 157 ms | 3712 KB |
subtask2-06.txt | AC | 155 ms | 3712 KB |
subtask2-07.txt | AC | 158 ms | 3712 KB |
subtask2-08.txt | AC | 155 ms | 3712 KB |
subtask2-09.txt | AC | 157 ms | 3712 KB |
subtask2-10.txt | AC | 155 ms | 3712 KB |
subtask2-11.txt | AC | 158 ms | 3712 KB |
subtask2-12.txt | AC | 155 ms | 3712 KB |
subtask2-13.txt | AC | 158 ms | 3712 KB |
subtask2-14.txt | AC | 155 ms | 3712 KB |
subtask2-15.txt | AC | 159 ms | 3712 KB |