Hi, please tell me some nice and difficult tasks from CodeForces thar use either Binary Index Trees or Segment trees. Thanks very much!
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
Hi, please tell me some nice and difficult tasks from CodeForces thar use either Binary Index Trees or Segment trees. Thanks very much!
Name |
---|
Russian statements — easy, just train
276E - Little Girl and Problem on Trees
Easy: http://www.codeforces.com/problemset/problem/159/C http://www.codeforces.com/problemset/problem/276/C
Difficult: http://www.codeforces.com/gym/100155/problem/B
https://codeforces.net/problemset/problem/266/E