Submission #3003328

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U&... u) { v.resize(n); for (auto&& i : v) assign(i, u...); }

int main() {
  cin.tie(NULL); ios::sync_with_stdio(false);
  int n; cin >> n;
  V<> a(n); REP(i, n) cin >> a[i];
  V<> b(n), c(n); b[0] = c[n - 1] = 1;
  REP (i, n - 1) {
    if (a[i] < a[i + 1]) b[i + 1] = b[i] + 1;
    else b[i + 1] = 1;
  }
  for (int i = n - 2; i >= 0; i--) {
    if (a[i] > a[i + 1]) c[i] = c[i + 1] + 1;
    else c[i] = 1;
  }
  int res = 0;
  REP (i, n) {
    res = max(res, b[i] + c[i]);
  }
  cout << res - 1 << endl;
}

Submission Info

Judge Result