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 | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
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 |
---|