Submission #1672767

---

Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int N;
int ans[100010];

signed main() {
    cin >> N;
    vector<pii> v;
    v.push_back(pii(0, 0));
    rep(i,0,N) {
        int p; cin >> p;
        v.push_back(make_pair(p, -i));
    }

    sort(v.begin(), v.end(), greater<pii>());
    int idx = 0, c = INF;
    while(v[idx].first != 0) {
        chmin(c, -v[idx].second);

        int ub = N, lb = idx;
        while(ub - lb > 1) {
            int mid = (ub + lb) / 2;
            if(v[mid].first != v[idx].first) ub = mid;
            else lb = mid;
        }

        int diff = v[idx].first - v[ub].first;
        ans[c] += ub * diff;
        idx = ub;
    }

    rep(i,0,N) cout << ans[i] << endl;
    return 0;
}

Submission Info

Judge Result