Hello everybody! How to solve this problem using segment tree : https://codeforces.me/group/QjnVbUMccj/contest/502602/problem/E P.S : don't suggest scanline
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
How to solve it?
Hello everybody! How to solve this problem using segment tree : https://codeforces.me/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 |
---|