Codeforces 581B - Luxurious Houses
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.
範例:
input:
1 | 5 |
output:
1 | 3 2 0 2 0 |
input:
1 | 4 |
output:
1 | 2 3 4 0 |
題意:
給你N間房子的高度，從左到右。一間房子若是比他右邊所有的房子都要高的話就能稱為奢華，問你每一間房子各自若要變的奢華的話還要再增高多少？
思路:
從最右邊開始，記錄到目前為止最高的高度，然後若是自己比最高的高度還矮或是一樣，就加高，不然不用加。