Hi !!! I am learning algorithm. I think for a contest programmer there must be a proper order to learn!! May I know the order of learning algorithm for getting next topics easy and for a better performance in contest??(I mean, which should be first,second...etc..? among number theory,data structure, dp, counting ,graph etc.)
For me, I know many of graph algorithms.But I didn't learn segment tree at all :( So, I think its not a proper way. I could never solved a graph problem in contest. I could spent this time in data structure/dp and my basic could be stronger and i could got a good rating in cf contests???
It seems natural to learn topics when you meet them, if they are not too hard for you right now. Read editorial after contest, upsolve this contest, and if you need to learn something new in order to solve some of problems — learn it.
I_love_Tanya_Romanova thank you very much for your suggestion. I usually didn't do this. It may be a cause. Again, Thank you very much.. :)