How to solve this 1313C2 - Небоскрёбы (усложнённая версия) with segment tree ?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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 ツ