提出 #70622651

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n;
    cin >> n;
    
    vector<ll> positions(n);
    for (int i = 0; i < n; i++) {
        cin >> positions[i];
    }
    
    // Add position 0 for person 0
    vector<ll> all_pos = {0};
    
    for (int i = 0; i < n; i++) {
        all_pos.push_back(positions[i]);
        
        // Coordinate compression
        vector<ll> unique_pos = all_pos;
        sort(unique_pos.begin(), unique_pos.end());
        unique_pos.erase(unique(unique_pos.begin(), unique_pos.end()), unique_pos.end());
        
        ll sum = 0;
        int sz = unique_pos.size();
        
        if (sz == 1) {
            sum = 0;
        } else if (sz == 2) {
            sum = 2 * (unique_pos[1] - unique_pos[0]);
        } else {
            sum += unique_pos[1] - unique_pos[0];  // first position
            sum += unique_pos[sz-1] - unique_pos[sz-2];  // last position
            
            for (int j = 1; j < sz - 1; j++) {
                ll left_dist = unique_pos[j] - unique_pos[j-1];
                ll right_dist = unique_pos[j+1] - unique_pos[j];
                sum += min(left_dist, right_dist);
            }
        }
        
        cout << sum << "\n";
    }
    
    return 0;
}

提出情報

ジャッジ結果