Submission #2522403

---

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(N-1);
    vector<int>change;
    change.push_back(0);
    //bool last_up=true;

    rep(i,N){
        cin>>a[i];
        if(i!=0){updown[i-1]=(a[i]-a[i-1])>0;}
    }
    rep(i,updown.size()){
        if(i!=0){
            if(!updown[i-1]&&updown[i]){
                change.push_back(i+1);
            }
        }
    }
    change.push_back(N);
    int ans=-2189284;
    rep(i,change.size()){
        if(i!=0){
            ans=max(ans,change[i]-change[i-1]+1);
        }
    }
    cout<<min(ans,N)<<endl;
    return 0;
}

Submission Info

Judge Result