Submission #2520710

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

const ll inf = 1e15;
const ll mod = 1e9+7;

int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};

int main() {
    ll N; cin >> N;
    vector<ll> a(N); REP(i, N) cin >> a[i];
    
    ll ans = 0;
    ll cnt = 1;
    REP(i, N) {
        if (i == N-1 || (i != N-1 && a[i] >= a[i+1])) {
            ans += cnt * (cnt + 1) / 2;
            cnt = 1;
            continue;
        }
        cnt++;
    }
    cout << ans << endl;
    
    return 0;
}

Submission Info

Judge Result