Submission #3054080

---

Source Code Expand

#include<bits/stdc++.h>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define ALL(x) x.begin(),x.end()
#define EPS (1e-8)
#define equals(a,b) (fabs((a)-(b))<EPS)

using namespace std;

typedef long long ll;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;

inline bool LT(double a,double b) { return !equals(a,b) && a < b; }
inline bool LTE(double a,double b) { return equals(a,b) || a < b; }

void compute() {

}

int main() {
  int n ;
  cin >> n;
  vector<int> a(n);
  rep(i,n) cin >> a[i];
  ll cnt = 0;
  rep(i,n) {
    int L = i;
    int R = i;
    while( R + 1 < n && a[R] < a[R+1] ) {
      ++R;
    }
    ll x = R - L + 1;
    cnt += (x*(x+1)/2LL);
    i = R;
  }
  cout << cnt << endl;
  compute();
  return 0;
}

Submission Info

Judge Result