How to solve this 1313C2 - Небоскрёбы (усложнённая версия) with segment tree ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
How to solve this 1313C2 - Небоскрёбы (усложнённая версия) 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 ツ