Submission #1627878

---

Source Code Expand

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<stdlib.h>
#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000

using namespace std;


int main(void) {
	int n;
	int a[100010];
	int p = 0;
	long long int count = 0;

	cin >> n;
	FOR(i, 1, n) {
		cin >> a[i];
	}

	FOR(i, 1, n ) {
		FOR(t, i+1, n) {
			p = 0;
			while (a[i+p] < a[t+p]&&t+p<=n) {
				count++;
				p++;
			}
			FOR(u, 1, p) {
				count += (p - u);
			}
			i += p;
			break;
		}
	}
	count += n;
	
	cout << count << endl;
	return 0;
}

Submission Info

Judge Result