Hello everybody! How to solve this problem using segment tree : https://mirror.codeforces.com/group/QjnVbUMccj/contest/502602/problem/E P.S : don't suggest scanline
# | User | Rating |
---|---|---|
1 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 165 |
3 | Um_nik | 161 |
4 | atcoder_official | 160 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
How to solve it?
Hello everybody! How to solve this problem using segment tree : https://mirror.codeforces.com/group/QjnVbUMccj/contest/502602/problem/E P.S : don't suggest scanline
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
ru3 | _bruh_bruh | 2024-09-21 20:12:39 | 21 | Мелкая правка: 'roblem/E\nwithout scanline ' -> 'roblem/E\nP.S : don't suggest scanline' | ||
ru2 | _bruh_bruh | 2024-09-21 20:12:02 | 20 | Мелкая правка: '/problem/E' -> '/problem/E\nwithout scanline ' | ||
ru1 | _bruh_bruh | 2024-09-21 20:11:35 | 145 | Первая редакция (опубликовано) |
Name |
---|