How to solve this 1313C2 - Skyscrapers (hard version) with segment tree ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
5 | atcoder_official | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
How to solve this 1313C2 - Skyscrapers (hard version) with segment tree ?
Name |
---|
Here is my submision for this problem Your text to link here... If you want any more specification I can write it
I have solve it greedily . Please explain how you have approached with segment tree.
I am also using greedy algorithm, but my reason to use segment tree is to find the nearest small number for each number.
owwwwwwwwwwwwwwwww. The part I did with stack you did with segment tree. Thanks .
You are welcome ツ