Submission #1118035

---

Source Code Expand

#include <iostream>
#include <map>
#define INF 1e+18
#define int long long
using namespace std;
 
signed main(){
	map<int,int> next,cnt;
	int n,a[100000],prev = 0;
	cin >> n;
	int ma = 0;
	for(int i = 0;i < n;i++){
		cin >> a[i];
		cnt[a[i]]++;
		if(ma < a[i]){
			ma = a[i];
		}else a[i] = 0;
	}
	for(auto it = cnt.begin();it != cnt.end();it++){
		if(cnt[it->first]){
			next[it->first] = it->first - prev;
			prev = it->first;
		}
	}
	for(auto it = cnt.rbegin();it != cnt.rend();it++) {
		if(it != cnt.rbegin()) {
			it--;
			int c = cnt[it->first];
			it++;
			cnt[it->first] += c;
		}
	}
	for(int i = 0;i < n;i++){
		if(a[i]) cout << cnt[a[i]] * next[a[i]] << endl;
		else cout << 0 << endl;
	}
	return 0;
}

Submission Info

Judge Result