Given an array [1,3,4,2] we should get an array [0,0,0,2]. Can someone suggest a quick method for doing this
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 159 |
5 | atcoder_official | 156 |
6 | djm03178 | 153 |
6 | adamant | 153 |
8 | luogu_official | 149 |
9 | awoo | 147 |
10 | TheScrasse | 146 |
Given an array [1,3,4,2] we should get an array [0,0,0,2]. Can someone suggest a quick method for doing this
Name |
---|
This is essentially the inversion problem which can be solved using segment tree or binary indexes tree in O(nlogn). ( You can search for it online)
Iterate from the left and imagine the array is the skyscrapers with height a[i]. Now we want to maintain all skyscrapers visible from i. To do so just maintain a stack. O(n).
But If I input 1 3 5 4, the output is 2. What am I missing?