I’ve been participating in long competitions and trying to break the barrier of 7 questions(no success till date :()
I get stuck on problems associated with range queries, trees etc(QTREE*, GERALD2, QPOINT, MONOPLOY, and the list continues)
I want to learn all these trees and put a nail into the coffin once for all and I think If we could share some problems related to these concepts(codechef, spoj, codeforces, topcoder), it would be helpful for all the fellow coders.
TOPICS: Segment trees, lazy propagation, interval trees, splay trees, link-cut trees, Binary index trees, Kd trees, Quad trees, range queries, EVERYTHING \m/
Here are some problems I’ve found.
LEBOBBLE, QTREE, MSTICK, SORTING, SEABAL, PPLUCKY, RRANGE(SPOJ)
Please add to this list. Thanks in advance