Hi, everyone! I need some problems, which can be solved with Persistent data structures (It doens't matter what data structure as long as it is persistent). I searched but the only thing that I was able to find was this — http://blog.anudeep2011.com/persistent-segment-trees-explained-with-spoj-problems/ . There are like 5 problems, so I need more. I will be very glad if you could find me some. I need at least 4 or 5, so anything would be in help. Thank you!

Hi! I need information about some persistent data structures. I need them for a project. So up to now I have learnt persistent index trees (RMQ) and persistent segment trees (some kind of lazy propagation). And now i can't find anywhere information about other persistent structures. Please, help me if you can. I need all sort of information about these structure. Maybe some problems, analyzes, explanations or even some practical uses. I will be very grateful if you explain me structures like Persistent Union-Find, Persistent Heap or another one.

P.S. If it is not too much, I also need some explanations about Retro Active Data Structures.

Hello! These days I was learning RMQ. So now i need some problems on which I can keep training. Can you suggest me some Dynamic RMQ problems. It isn't problem if the suggestions are not from Codeforces. And if it isn't too much, can you post some problems with Hashing, please. Thanks and have a nice day ;)

P.S. Sorry if there was already some topics like this ( I didn't find them)