Submission #1232581


Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<numeric>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(lli i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b)-1);i>=((int)(a));i--)
typedef long long int lli;
typedef pair<int, int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define pque(type) priority_queue<type,vector<type>,greater<type> >
#define memst(a,b) memset(a,b,sizeof(a))
 
int main(void){
	lli n; cin >> n;
	vector<int> b(n+1);
	set<int> s;
	rep(i, n){
		int t; cin >> t;
		b[t] = i+1;
	}
	s.insert(0);
	s.insert(n+1);
	lli ans = 0;
	reg(i, 1, n){
		int t = b[i];
		s.insert(t);
		auto itr = s.find(t);
		lli l = *(--itr); ++itr;
		lli r = *(++itr);
		ans += (r-t)*(t-l) * i;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Minimum Sum
User ktyshmt
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1135 Byte
Status AC
Exec Time 162 ms
Memory 10368 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 13
Set Name Test Cases
Sample example0, example1, example2
All corner0, corner1, corner2, corner3, example0, example1, example2, maxrand0, maxrand1, maxrand2, rand0, rand1, rand2
Case Name Status Exec Time Memory
corner0 AC 162 ms 10368 KB
corner1 AC 162 ms 10368 KB
corner2 AC 1 ms 256 KB
corner3 AC 113 ms 10368 KB
example0 AC 1 ms 256 KB
example1 AC 1 ms 256 KB
example2 AC 1 ms 256 KB
maxrand0 AC 151 ms 10368 KB
maxrand1 AC 158 ms 10368 KB
maxrand2 AC 150 ms 10368 KB
rand0 AC 1 ms 256 KB
rand1 AC 1 ms 256 KB
rand2 AC 1 ms 256 KB