Submission #3330734

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <numeric>
#include <queue>
#include <map> 
#include <set>
#include <string>
#include <functional>
#include <list>
#include <random>
#include <time.h>
#include <iomanip>
#include <assert.h>
#define int long long
#define double long double
#define oku7 1000000007
#define MAXN (int)1e+5 * 2+1
#define LL_MAX 9223372036854775807	//ない環境用
#define LL_HALFMAX 9223372036854775807 / 2	//ない環境用

using namespace std;
std::mt19937 mt((int)time(0));

int dx[4] = { 0, 1, 0, -1 }; // x軸方向への変位
int dy[4] = { 1, 0, -1, 0 }; // y軸方向への変位

int a[200001];
int mapData[200001];

signed main() {
	int N;
	cin >> N;
	for (int i = 0; i < N; i++) {
		int inp;
		cin >> inp;
		a[i] = inp;
		mapData[inp] = i+1;
	}
	set<int> s{0,N+1};
	auto last = s.end();
	int ans = 0;
	for (int i = 1; i <= N; i++) {
		//int l, r;
		s.insert(mapData[i]);
		auto near = s.find(mapData[i]);
		auto lit = near;
		auto rit = near;
		lit--;
		rit++;
		int add = (mapData[i] - *lit ) * (*rit - mapData[i] );
		add *= i;
		ans += add;
	}
	cout << ans << "\n";


}

Submission Info

Judge Result