Submission #1797196

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include <iomanip>
#include<map>
#include<limits>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<utility>
#include<complex>
#include<cstdlib>
#include<set>
#include<cctype>

#define DBG cerr << '!' << endl;
#define REP(i,n) for(int (i) = (0);(i) < (n);++i)
#define rep(i,s,g) for(int (i) = (s);(i) < (g);++i)
#define rrep(i,s,g) for(int (i) = (s);i >= (g);--(i))
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cerr << v[i] << ' ';cerr << endl << endl;}
#define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;}
#define ALL(v) v.begin(),v.end()

using namespace std;

typedef long long ll;
typedef vector<int> iv;
typedef vector<iv> iiv;
typedef vector<string> sv;

ll ans[100010];
int num[100010];
ll sum;
#define INF 1000100

int main()
{
	ll n;cin >> n;
	vector<ll> v;
	ll a1;cin >> a1;sum += a1;
	v.PB(a1);
	map<ll,ll> mp;
	mp[a1] = 1;
	ll sa = 0;

	
	REP(i,n-1)
	{
		int a;cin >> a;sum += a;
		decltype(v)::iterator tmp;
		tmp = lower_bound(ALL(v),a+1);
		if(tmp == v.end())
		{
			v.PB(a);
			mp[a] = i+2;
			num[i+2]++;
		}
		else if(tmp != v.begin())
		{
			int tt = a - *(tmp-1);
			ans[mp[*tmp]] += tt;
			sa += tt;
			num[mp[*(tmp-1)]]++;
		}
	}
		
	/*
	SHOW1d(num,n+1);
	SHOW1d(ans,n+1);
	*/
	
	ll cou = 0;
	for(int i = v.size()-1;i > 0;i--)
	{
		cou += num[mp[v[i]]];
		ll tmp = cou * (v[i] - v[i-1]);
		ans[mp[v[i]]] += tmp;
		sa += tmp;
	}
	//cout << sum << ' ' << sa << endl;
	ans[1] = sum - sa;
	
	for(int i = 1;i <= n;i++)
	{
		cout << ans[i] << endl;
	}
	
		
	
	
	return 0;
}

Submission Info

Judge Result