Submission #3006584
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define ll long long int n,ans,h[1000005]; int main(){ cin>>n; for(int i=0;i<n;++i){ cin>>h[i]; } for(int i=0;i<n;++i){ if((i==0||h[i-1]<=h[i]) && (i=n-1||h[i]>=h[i+1])){ int temp=1; for(int j=i-1;0<=j&&h[j]<h[j+1];--j)++temp; for(int j=i+1;j<n &&h[j]<h[j-1];++j)++temp; ans=max(ans,temp); } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 山のデータ |
User | es135 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 447 Byte |
Status | WA |
Exec Time | 2103 ms |
Memory | 1408 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | TLE | 2103 ms | 256 KB |
subtask0-sample-02.txt | WA | 1 ms | 256 KB |
subtask1-01.txt | AC | 1 ms | 256 KB |
subtask1-02.txt | TLE | 2103 ms | 256 KB |
subtask1-03.txt | TLE | 2103 ms | 256 KB |
subtask1-04.txt | TLE | 2103 ms | 256 KB |
subtask1-05.txt | WA | 1 ms | 256 KB |
subtask1-06.txt | TLE | 2103 ms | 256 KB |
subtask1-07.txt | TLE | 2103 ms | 256 KB |
subtask1-08.txt | TLE | 2103 ms | 256 KB |
subtask1-09.txt | TLE | 2103 ms | 256 KB |
subtask1-10.txt | TLE | 2103 ms | 256 KB |
subtask1-11.txt | TLE | 2103 ms | 256 KB |
subtask1-12.txt | TLE | 2103 ms | 256 KB |
subtask1-13.txt | TLE | 2103 ms | 256 KB |
subtask1-14.txt | TLE | 2103 ms | 256 KB |
subtask1-15.txt | TLE | 2103 ms | 256 KB |
subtask2-01.txt | TLE | 2103 ms | 256 KB |
subtask2-02.txt | TLE | 2103 ms | 512 KB |
subtask2-03.txt | TLE | 2103 ms | 768 KB |
subtask2-04.txt | TLE | 2103 ms | 1408 KB |
subtask2-05.txt | TLE | 2103 ms | 1408 KB |
subtask2-06.txt | TLE | 2103 ms | 1408 KB |
subtask2-07.txt | TLE | 2103 ms | 1408 KB |
subtask2-08.txt | TLE | 2103 ms | 1408 KB |
subtask2-09.txt | TLE | 2103 ms | 1408 KB |
subtask2-10.txt | TLE | 2103 ms | 1408 KB |
subtask2-11.txt | TLE | 2103 ms | 1408 KB |
subtask2-12.txt | TLE | 2103 ms | 1408 KB |
subtask2-13.txt | TLE | 2103 ms | 1408 KB |
subtask2-14.txt | TLE | 2103 ms | 1408 KB |
subtask2-15.txt | TLE | 2103 ms | 1408 KB |