Submission #2248172

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,ll> P;
typedef pair<ll,P> PP;

//-----------------------------------------------------------------------------

int n;
ll a[100000];
vector<P> vec,A;
ll ans[100000];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n;
	REP(i,n) {
		cin>>a[i];
		A.pb(P(a[i],i));
	}
	sort(ALL(A));
	ll prv=0;
	REP(i,n) {
		if(a[i]>prv) {
			vec.pb(P(i,a[i]-prv));
			prv=a[i];
		}
	}
	for(auto it:vec) {
		int idx=lower_bound(ALL(A),P(a[it.fi],it.fi))-A.begin();
		idx=n-idx;
		ans[it.fi]=it.se*idx;
	}
	REP(i,n) cout<<ans[i]<<endl;

	return 0;
}

Submission Info

Judge Result