Submission #1515416

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=j; i<=k; i++)
#define FFOR(i, j, k) for(int i=j; i<k; i++)
#define DFOR(i, j, k) for(int i=j; i>=k; i--)
#define bug(x) cerr<<#x<<" = "<<x<<'\n'
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
template <typename T> inline void read(T &x){
    char c;
    bool nega=0;
    while((!isdigit(c=getchar()))&&(c!='-'));
    if(c=='-'){
        nega=1;
        c=getchar();
    }
    x=c-48;
    while(isdigit(c=getchar())) x=x*10+c-48;
    if(nega) x=-x;
}
template <typename T> inline void writep(T x){
    if(x>9) writep(x/10);
    putchar(x%10+48);
}
template <typename T> inline void write(T x){
    if(x<0){
        putchar('-');
        x=-x;
    }
    writep(x);
}
template <typename T> inline void writeln(T x){
    write(x);
    putchar('\n');
}
#define taskname "E"
int n;
ll a[100001];
int pos[100002];
bool cmp(int x, int y){
    if(a[x]!=a[y]) return a[x]>a[y];
    else return x<y;
}
ll ans[100001];
int main(){
    #ifdef Megumin
        if(fopen(taskname".inp", "r"))
            freopen(taskname".inp", "r", stdin);
    #endif // Megumin
    read(n);
    FOR(i, 1, n){
        read(a[i]);
        pos[i]=i;
    }
    sort(pos+1, pos+n+1, cmp);
    int i=1, j;
    ll sum=0;
    while(i<=n){
        j=i+1;
        sum+=a[pos[i]];
        while(j<=n&&(pos[j]>pos[i])){
            sum+=a[pos[j]];
            j++;
        }
        ll down=sum-a[pos[j]]*(j-1);
        sum-=down;
        ans[pos[i]]+=down;
        i=j;
    }
    FOR(i, 1, n) writeln(ans[i]);
}

Submission Info

Judge Result