Hi everyone. I recently started learning Segment Tree. So now I want to solve more problems with Segment Tree in Codeforces. Can you suggest me some problems similar to a Segment Tree, like 896E - Welcome home, Chtholly? So I can improve myself?
Thanks in advance!
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Hi, I think you should work with cses. There are a lot of problems about Data Structs!
Hi, thanks for your answer and attention! But I have already solved problems in cses that are about Data Structs!
I like your opinion!
i think begin with a problem 3100 is not wise choice
you should see the codeforces edu
Thanks for your opinion and attention!
Uh in fact 896E is a problem about sqrt-decomposition and DSU……which is known as "第二分块" in China.