Submission #2510810

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#include <set>
#include <random>
#include <sstream>
#include <stack>
#include <deque>

using namespace std;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;

const int INF = (int) 1e9;
const int MAX_V = 1000;

int N;
int ans = 0;
int up = 1;
int l = 0;
int pre;
vi h(300000);
vi used(300000, 0);

int main() {
    cin >> N;
    rep(i,N) cin >> h[i];
    rep(i,N) {
        if (i == N-1 || (!used[i] && h[i+1] <= h[i])) {
                int l, r;
                int j = i-1;
                while (j >= 0 && h[j] < h[j+1]) {
                    used[j] = 1;
                    j--;
                }
                l = i - j - 1;
                j = i+1;
                while (j < N && h[j] < h[j-1]) {
                    used[j] = 1;
                    j++;
                }
                r = j - i - 1;
                ans = max(ans, l + r + 1);
            }
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result