Submission #2510790

---

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 = 1;
int up = 1;
int l = 0;
int pre;

int main() {
    cin >> N;
    cin >> pre;
    REP(i,1,N) {
        int h;
        cin >> h;
        if (up == 1) {
            if (h <= pre) {
                up = 0;
            }
        } else {
            if (h >= pre) {
                ans = max(ans, i-l+1);
                l = i;
                up = 1;
            }
        }
        pre = h;
    }
    ans = max(ans, N-l);
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result