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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | Um_nik | 162 |
3 | maomao90 | 161 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
5 | -is-this-fft- | 158 |
7 | adamant | 154 |
7 | Dominater069 | 154 |
9 | awoo | 152 |
9 | luogu_official | 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 |
---|