Submission #2519606

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <map>
#include <math.h>
#include <string>
typedef long long ll;

using namespace std;

int main(){
    ll N;
    cin >> N;
    ll a[100010] = {0};
    for (int i = 0; i < N; i++){
	cin >> a[i];
    }

    ll p[100010]; 
    p[0] = -1;
    ll size = 1;
    for (int i = 0; i < N-1; i++){
	if (a[i] >= a[i+1]){
	    p[size] = i;
	    size++;
	}
    }
    p[size] = N-1;
    size++;

    ll res = 0;
    for (int i = 1; i < size; i++){
	ll n = p[i]-p[i-1];
	res += (n*n+n)/2;
    }

    cout << res << endl;

    return 0;
}

Submission Info

Judge Result