cf 581 B.Luxurious Houses

B. Luxurious Houses

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The capital of Berland has n multifloor buildings. The architect who built up the capital was very creative, so all the houses were built in one row.

Let's enumerate all the houses from left to right, starting with one. A house is considered to be luxurious if the number of floors in it is strictly greater than in all the houses with larger numbers. In other words, a house is luxurious if the number of floors in it is strictly greater than in all the houses, which are located to the right from it. In this task it is assumed that the heights of floors in the houses are the same.

The new architect is interested in n questions, i-th of them is about the following: "how many floors should be added to the i-th house to make it luxurious?" (for all i from 1 to n, inclusive). You need to help him cope with this task.

Note that all these questions are independent from each other — the answer to the question for house i does not affect other answers (i.e., the floors to the houses are not actually added).

Input

The first line of the input contains a single number n (1 ≤ n ≤ 105) — the number of houses in the capital of Berland.

The second line contains n space-separated positive integers hi (1 ≤ hi ≤ 109), where hiequals the number of floors in the i-th house.

Output

Print n integers a1, a2, ..., an, where number ai is the number of floors that need to be added to the house number i to make it luxurious. If the house is already luxurious and nothing needs to be added to it, then ai should be equal to zero.

All houses are numbered from left to right, starting from one.

Sample test(s)

input

5
1 2 3 1 2

output

3 2 0 2 0 

input

4
3 2 1 4

output

2 3 4 0 

题意，有个工程师想吧每个房子变成一个奢华的房子，每个房子变成奢华的，奢华房子的定义就是房子的地板的模板数成为从右往左数最大，输出每个房子变奢华的木板数

思路:从最后往前面扫描一遍，并且记录，到当前位置最奢华的房子的木板数，然后把这个点的输出变成最奢华房子的木板数-当前的然后+1，如果当前房子就是最奢华的这个点输出0

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
#define maxn 100010

int c[maxn],dis[maxn];

int main()
{
    int n,Max = -1,x;
    cin>>n;
    for(int i = 0; i < n; i++)
        cin>>c[i];
    for(int i = n-1; i >= 0; i--){
        if(c[i] > Max){
            Max = c[i];
            dis[i] = 0;
        }
        else{
            dis[i] = Max - c[i] + 1;
        }
    }
    cout<<dis[0];
    for(int i = 1; i < n; i++)
        cout<<" "<<dis[i];
    cout<<endl;
    return 0;
}