Collection of segtree problems that can be solved by set?

Revision en2, by Divide_By_0, 2016-01-13 02:03:43

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? Even one or two would be great, and they don't have to be from CF but should have a place with a solution/editorial.

One great example is USACO 2015 Dec. — High Card Low Card (Problem), whose solution uses segtrees but has a much more brief solution with sets. (Solution)

Tags c++, segtree, set

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Divide_By_0 2016-01-13 02:03:43 409
en1 English Divide_By_0 2016-01-12 23:19:24 210 Initial revision (published)