Submission #3921563

---

Source Code Expand

#include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#include <type_traits>
#define int long long
#define ll long long
#define mod  1000000007
#define MOD  1000000007
#define inf 1e17
#define rep(i,j,n) for(int i=j;i<n;i++)
#define P pair<int,int>
#define ps push_back
double pi = 3.141592653589793;
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    fill( (T*)array, (T*)(array+N), val );
}
//ここから始めよう
signed main(){
    int n;cin>>n;
    int c=-1;
    int cnt=1;
    vector<P>v;
    int a[314514];
    rep(i,0,n){
        cin>>a[i];
        if(i==0)continue;
        else if(i==1){
            if(a[i]>a[i-1])c=1;
            else c=0;
            cnt++;
        }
        else {
            int pre;
            if(a[i]>a[i-1])pre=1;
            else pre=0;
            if(pre==c)cnt++;
            else{
                v.ps(P(cnt,c));
                c=pre;
                cnt=1;
            }
        }
    }
    v.ps(P(cnt,c));
    rep(i,1,v.size()){
        v[i].first++;
    }
    rep(i,0,v.size()){
        //cout<<v[i].first<<" "<<v[i].second<<endl;
    }
    int ans=0;
    rep(i,0,v.size()-1){
        if(v[i].second)ans=max(ans,v[i].first+v[i+1].first-1);
    }
    rep(i,0,v.size()){
        ans=max(ans,v[i].first);
    }
    cout<<ans<<endl;return 0;
}

Submission Info

Judge Result