【Henu ACM Round#19 B】 Luxurious Houses

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

const int N = 1e5;

int a[N+10],n;

int main()
{
    cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i];
    int now=0;
    for (int i = n;i >= 1;i--){
        int t = a[i];
        if (a[i]<=now){
                a[i] = now-a[i]+1;

        }else a[i] = 0;

        if (i==n)
                now = t;
        else
                now = max(now,t);
    }
    for (int i = 1;i <= n;i++) cout<<a[i]<<' ';
    return 0;
}