Codeforces 625B 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 hi equals 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.

Examples

input

5
1 2 3 1 2

output

3 2 0 2 0 

input

4
3 2 1 4

output

2 3 4 0 

题目大意：

一共给你N个楼的高度，设定一个luxurious楼，表示这个楼严格要与他右边的所有的楼。

问如果我们想要设定第i个楼为luxurious楼，那么对应最少需要加多少楼层。

思路：

正序判断O（n^2）超时肯定是会TLE的，我们对应这个楼想要变成luxurious楼，肯定是要比他后边所有的楼都高才行。

那么对应我们只要维护出当前位子后边最高的楼的层数即可。

所以我们直接从后边向前扫，逆序处理这个问题即可，时间复杂度O（n^2）

Ac代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int ans[100600];
int a[100600];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        int maxn=0;
        for(int i=n-1;i>=0;i--)
        {
            if(i==n-1)
            {
                ans[i]=0;
                maxn=max(maxn,a[i]);
                continue;
            }
            if(maxn==a[i])
            {
                ans[i]=1;
            }
            else if(a[i]>maxn)
            {
                ans[i]=0;
                maxn=a[i];
            }
            else
            {
                ans[i]=maxn-a[i]+1;
            }
        }
        for(int i=0;i<n;i++)
        {
            printf("%d ",ans[i]);
        }
        printf("\n");
    }
}