its a dp prob...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit
spoj.pl/problems/BOTTOM
my algo for this prob goes by this way..will this work correctly?
1)first make a bfs from an arbitrary node and store the nodes visited
in order in an array.
2)the node that is visited at the end of the BFS in the 1st bfs is now
taken as the root and then make a BFS from
