Submission #1671031

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

int n, a[100010];
vi solve_naive(){
	vi ans(n),  aprev(n); rep(i, n) aprev[i] = a[i];
	rep(it, n){
		int mx = -1, mxi, mx2 = -1, mx2i;
		rep(i, n) if(a[i] > mx) mx = a[i], mxi = i;
		rep(i, mxi) if(a[i] > mx2) mx2 = a[i], mx2i = i;
		if(mx2 < 0){
			rep(i, n) ans[mxi] += a[i];
			break;
		}
		int cnt = 0;
		for(int i = mxi; i < n; i++){
			cnt += max(0, a[i] - mx2);
			a[i] = min(a[i], mx2);
		}
		ans[mxi] += cnt;
	}
	rep(i, n) a[i] = aprev[i];
	return ans;
}
int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	
	cin >> n;
	rep(i, n) cin >> a[i+1];
	//dbg(solve_naive());
	n++;
	vi idx;
	int prev = -1;
	rep(i, n) if(a[i] > prev){
		prev = a[i];
		idx.pb(i);
	}
	set<pi> vals;
	vector<ll> ans(n);
	for(int ii = idx.size() - 1, j = n - 1; ii > 0; ii--){
		int i = idx[ii - 1];
		while(j > i){
			if(a[j] >= a[i]) ans[idx[ii]] += a[j] - a[idx[ii]];
			else vals.emplace(-a[j], j);
			j--;
		}
		set<pi> dels;
		for(auto it = vals.begin(); it != vals.end() && -it->first >= a[i]; it++){
			dels.insert(*it);
			ans[idx[ii]] += -it->first - a[idx[ii]];
		}
		for(auto it : dels) vals.erase(it);
		
		ans[idx[ii]] += (n - 1ll - i - vals.size()) * (a[idx[ii]] - a[i]);
	}
	rep(i, n-1) cout << ans[i+1] << endl;
	
	return 0;
}

Submission Info

Judge Result