any suggestion ? :D
Remove "advance data structures" tag.
Segment tree is way away from advance data structures.

More Problems

One more: 1172F - Nauuo and Bug

BTW, I think it would be better if you sort these problems by difficulties, or classify them into different types, like this blog.

And do you choose all the problems which are solvable by segment tree, even if there are both faster and easier solutions? I've noticed that 516C - Drazil and Park only needs RMQ, and 516D - Drazil and Morning Exercise's official solution doesn't need any advanced data structures (I don't think union-find-set is), however, I have a solution using segment tree with worse complexity ($$$O(qn\log^2 n)$$$) but less observation, does this make it a segment tree problem? Or there are faster segment tree solutions?

UPD: seems that these two problems are from this blog.

+

Fype

• https://www.e-olymp.com/en/problems/4481
• https://www.e-olymp.com/en/problems/4482
• https://www.e-olymp.com/en/problems/4483
• https://www.e-olymp.com/en/problems/4484
• https://www.e-olymp.com/en/problems/4485
• https://www.e-olymp.com/en/problems/4486
• https://www.e-olymp.com/en/problems/4487
• https://www.e-olymp.com/en/problems/4488
• https://www.e-olymp.com/en/problems/4489
• https://www.e-olymp.com/en/problems/4490
• https://www.e-olymp.com/en/problems/4491
• https://www.e-olymp.com/en/problems/4492
• https://www.e-olymp.com/en/problems/4493
• https://www.e-olymp.com/en/problems/4494
• https://www.e-olymp.com/en/problems/4495
• https://www.e-olymp.com/en/problems/4496
• https://www.e-olymp.com/en/problems/4497
• https://www.e-olymp.com/en/problems/4498
• https://www.e-olymp.com/en/problems/4499
• https://www.e-olymp.com/en/problems/4500

Can anybody help me with the SPOJ-PERMPATT problem? I saw people building segment trees for finding minimum element but there should be one more idea i cannot catch.

Other problems can be solved by Segment Tree: 1070C - Cloud Computing, 900C - Remove Extra One. Bonus: 1795E - Explosions? (this problem can be solved with other shorter solutions, but we can use Segment Tree as a practice)