Submission #1512371

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<ll,ll>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
P A[100100];
ll res[100100];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N;

    for(int i=0;i<N;++i){
        std::cin >> fst(A[i]);
        fst(A[i]) = -fst(A[i]);
        snd(A[i]) = i;
    }

    sort(A, A+N);

    int mn = snd(A[0]);
    for(int i=0,j=0;i<N;i=j){
        mn = min<int>(mn, snd(A[i]));
        
        while(j < N && fst(A[j]) == fst(A[i])){
            ++j;
        }
        
        if(j == N){
            res[mn] += -fst(A[i]) * j;
            break;
        }

        ll diff = fst(A[j]) - fst(A[i]);
        res[mn] += diff * j;
    }

    for(int i=0;i<N;++i){
        std::cout << res[i] << std::endl;
    }
}

Submission Info

Judge Result