- Recently I came across a new idea to solve graph related problems using segment trees, I would like to discuss the same with a problem.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
6 | adamant | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Segment tree for graph problems
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en10 | ASHWANTH_K | 2024-11-01 12:05:17 | 0 | (published) | ||
en9 | ASHWANTH_K | 2024-11-01 12:04:45 | 805 | Tiny change: 'ch of the M lines con' -> 'ch of the $M$ lines con' | ||
en8 | ASHWANTH_K | 2024-11-01 09:00:59 | 51 | Tiny change: 'ke: \n[Imgur](https://' -> 'ke: \n[ ](https://' | ||
en7 | ASHWANTH_K | 2024-11-01 08:44:57 | 96 | Tiny change: ' \n ![ ](https://' -> ' \n ![](https://' | ||
en6 | ASHWANTH_K | 2024-11-01 08:37:06 | 454 | |||
en5 | ASHWANTH_K | 2024-11-01 08:31:48 | 486 | |||
en4 | ASHWANTH_K | 2024-11-01 08:26:10 | 444 | |||
en3 | ASHWANTH_K | 2024-11-01 08:16:41 | 967 | Tiny change: ' \n \nExample: \n \n' -> ' \n \n**Example:** \n \n' | ||
en2 | ASHWANTH_K | 2024-11-01 08:04:24 | 508 | |||
en1 | ASHWANTH_K | 2024-11-01 07:58:37 | 187 | Initial revision (saved to drafts) |
Название |
---|