Problem hidden
SMCNT - Smaller Count
Given an unsorted array arr[] of integers, Print Count of number of smaller elements on right of each element in the array.
Input
An array of integers where each element of array abs(value)<=10^6
The size of the array is of the order of 10^6
Output
Print the space separated list of number of smaller elements on right of each element in the array.
Example
Input:12 1 2 3 0 11 1Output:6 1 2 2 0 1 0
Added by: | priyamehtanit |
Date: | 2012-02-14 |
Time limit: | 0.100s-1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |