Submission #1118458

---

Source Code Expand

#include <iostream>
#include <map>
#include <algorithm>
#define INF 1e+18
#define int long long
using namespace std;
 
signed main(){
	int n,a[100000],first[100000] = {},next[100000],cnt[100000],prev = 0;
	cin >> n;
	int ma = 0;
	for(int i = 0;i < n;i++){
		cin >> a[i];
		if(ma < a[i]){
			first[i] = a[i];
			ma = a[i];
		}
	}
	sort(a,a + n);
	for(int i = 0;i < n;i++){
		if(!first[i]) continue;
		cnt[i] = n - (int)(lower_bound(a,a + n,first[i]) - a);
	}
	for(int i = 0;i < n;i++){
		if(cnt[i]){
			next[i] = first[i] - prev;
			prev = first[i];
		}
	}
	for(int i = 0;i < n;i++){
		//cout << cnt[i] << " " << next[i] << endl;
		if(first[i]) cout << cnt[i] * next[i] << endl;
		else cout << 0 << endl;
	}
	return 0;
}

Submission Info

Judge Result