HUST Monthly 2011.04.09

From: 2011-04-09 13:00:00 To: 2011-04-09 17:00:00 Now: 2017-09-22 06:51:41 Status: Public

C - reverse order 1

Time Limit: 1s Memory Limit: 128MB

Submissions: 691 Solved: 144
Description

Here is a sequence a1..n, which is a disordered sequence from 1 to N. If i < j and ai > aj, then <i, j> is called a pair of inversion. And b1..n-1 is defined as follows, bk is the number of the total inversion pairs in array a, when i<=k<j. Now the array b is required while the array a is known.

Input

Several cases end with the end of the file;

And each of the cases includes two lines, a integer n(2<=n<=10^5)in the first line, and the second line followed with n integer, which is in the presentation of array a;

Output

Output the answer of each case in a line, namely the array b, and a space is required between the adjacent integers.

Sample Input
5
3 1 4 2 5
Sample Output
2 1 2 0
Hint
Source