What is the fastest algorithm to compute maximal bipartite matching. What is its worst case run time complexity. How to construct the worst case for such algorithm. Thanks in advance.

Is there a way to find official srm submission of any user in topcoder? somithing like this at codeforces. thanks

I wanted to know what are different resources from which IOI participants from different countries use to practice. Also where can I find problems and their analysis of previous IOI task similar to IMO tasks which are available at Link

Thanks and have a good day :)

Can someone provide me the original paper on binary indexed tree of P. M. Fenwick, “A new data structure for cumulative frequency tables,” I searched on web but couldn't get. thanks