Submission #1832736

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

int main(){
	ll n;
	cin>>n;
	vector<ll> x(n);
	vector<P> v(n);
	rep(i, n) cin>>x[i];
	rep(i, n) v[i] = P(x[i], i);
	sort(all(v));
	ll sum = 0, mx = 0, res2 = 0, p = 0, q = 0;
	vector<ll> res(n);
	while(p<n){
		//cerr<<"p: "<<p<<" ";
		while(v[q].fst<x[p]){
			sum += v[q].fst-mx;
			q++;
		}
		//cerr<<"q: "<<q<<" v[q].snd: "<<v[q].snd<<endl;
		res[p] = (n-q)*(x[p]-mx)+sum;
		res2 = res[p];
		mx = x[p];
		sum = 0;
		while(p<n && x[p]<=v[q].fst) p++;
	}
	rep(i, n) cout<<res[i]<<endl;
	return 0;
}

Submission Info

Judge Result