Submission #2199590

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    int N;
    cin >> N;
    vector<long long> V(N);
    for ( int i = 0; i < N; i++ ) {
        cin >> V[i];
    }

    int ans = 1;
    int r,l;
    r = l = 0;
    bool top = false;
    while ( true ) {        
        r++;
        if ( r == N ) { break; }
        // cout << l << " " << r << endl;

        if ( top && V[r-1] < V[r] ) {
            l = r-1;
            r = l;
            top = false;
        }
        else if ( !top && V[r-1] > V[r] ) { top = true; }
        ans = max( ans, r-l+1 );
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result