I know there are many segtree problems on cf, but is there a collection of segtree problems that have much more brief solutions using C++'s standard set?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Collection of segtree problems that can be solved by set?
I know there are many segtree problems on cf, but is there a collection of segtree problems that have much more brief solutions using C++'s standard set?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | Divide_By_0 | 2016-01-13 02:03:43 | 409 | |||
en1 | Divide_By_0 | 2016-01-12 23:19:24 | 210 | Initial revision (published) |
Name |
---|