title: Material and Information to improve algorithmic knowledge
body: <p>Lately I have been stuck on improving my algorithmic skills. And at this point I am finding myself out of good material for solving grid problems based on dfs and bsf. I somehow managed to do <a href="http://www.spoj.pl/problems/POUR1/" rel="nofollow">http://www.spoj.pl/problems/POUR1/</a> with a brute force logic but i recently go-ogled to find out that the problem can be done by bfs. But I can't figure out exactly how to go about it. Can someone please provide some text to read or some kind of explanation to the above mentioned problem so I can add this to my skill set. It would be extremely kind if you could even help me out for these techniques in problems like these <a href="http://www.codechef.com/problems/MMANT/" rel="nofollow">http://www.codechef.com/problems/MMANT/</a> .please help as soon as possible I am really stuck in these kind of problems ant can't move on. It would also be really kind if u could provide a list of good questions about Binary Indexed Trees and segment trees and some more examples of their usage.</p>
  
  <p>Thanks for the help!! :)</p>