Submission #2522501
Source Code Expand
#include <iostream> #include <stdio.h> #include <stack> #include <queue> #include <algorithm> #include <set> #include <math.h> #include <iomanip> #include <vector> using namespace std; #define ll long long #define rep(i,n) for(ll i=0;i<n;++i) #define Sort(a) sort(a.begin(),a.end()) int main(){ int N; cin>>N; vector<ll>a(N); vector<bool>updown; vector<int>change; // change.push_back(0); //bool last_up=true; //updown.push_back(true); rep(i,N){ cin>>a[i]; if(i!=0){updown.push_back((a[i]-a[i-1])>0);} } change.push_back(0); rep(i,updown.size()){ if(i!=0){ if(!updown[i-1]&&updown[i]){ change.push_back(i); } } } change.push_back(N); int ans=-2189284; ///// ///// rep(i,change.size()){ if(i!=0){ ans=max(ans,change[i]-change[i-1]); } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ぐっすり |
User | rayhotate |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1000 Byte |
Status | WA |
Exec Time | 25 ms |
Memory | 1408 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.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, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | WA | 20 ms | 1152 KB |
subtask1_02.txt | WA | 7 ms | 512 KB |
subtask1_03.txt | AC | 6 ms | 512 KB |
subtask1_04.txt | WA | 4 ms | 384 KB |
subtask1_05.txt | WA | 17 ms | 1024 KB |
subtask1_06.txt | WA | 12 ms | 768 KB |
subtask1_07.txt | WA | 18 ms | 1024 KB |
subtask1_08.txt | WA | 6 ms | 512 KB |
subtask1_09.txt | WA | 22 ms | 1152 KB |
subtask1_10.txt | WA | 19 ms | 1024 KB |
subtask1_11.txt | WA | 3 ms | 384 KB |
subtask1_12.txt | WA | 17 ms | 1024 KB |
subtask1_13.txt | WA | 23 ms | 1280 KB |
subtask1_14.txt | WA | 12 ms | 768 KB |
subtask1_15.txt | WA | 25 ms | 1408 KB |
subtask1_16.txt | WA | 24 ms | 1408 KB |
subtask1_17.txt | WA | 24 ms | 1408 KB |
subtask1_18.txt | WA | 25 ms | 1408 KB |
subtask1_19.txt | WA | 25 ms | 1408 KB |
subtask1_20.txt | AC | 25 ms | 1408 KB |
subtask1_21.txt | WA | 25 ms | 1408 KB |
subtask1_22.txt | WA | 25 ms | 1408 KB |
subtask1_23.txt | WA | 25 ms | 1408 KB |
subtask1_24.txt | WA | 25 ms | 1408 KB |
subtask1_25.txt | WA | 25 ms | 1408 KB |
subtask1_26.txt | WA | 25 ms | 1408 KB |
subtask1_27.txt | WA | 25 ms | 1408 KB |
subtask1_28.txt | WA | 25 ms | 1408 KB |
subtask1_29.txt | WA | 24 ms | 1408 KB |
subtask1_30.txt | WA | 24 ms | 1280 KB |
subtask1_31.txt | WA | 23 ms | 1280 KB |