Submission #2519458

---

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 m[100010][2];
    for (int i = 0; i < N; i++){
	int x = i;
	m[i][0] = x;
	while (a[x] < a[x+1]){
	    x++;
	}
	m[i][1] = x;
    }

    ll res = 0;
    for (int i = 0; i < N; i++){
	res += m[i][1]-m[i][0]+1;
    }

    cout << res << endl;

    return 0;
}

Submission Info

Judge Result