I have been thinking of an algorithm which could find the Sum Of Maximum's of all contigous sub-arrays of length k of a given Array. for each k from 1 to n , seperatly. n is the length of the array. I am able to figure out an O(N^2) solution. But could not reduce the complexity further. It would be helpful if someone could tell a sub-quadratic approach.(Possibly O(n) ). This is in reference to this problem. Any help is appreciated. NOTE : the answer for each k has to be printed seperately. Thanks :)
Need help in Iterative implementation of Kosaraju's or Tarjan's algorithm for finding strongly connected components in a graph !
I am currently solving a problem on SPOJ on strongly connected components. I think i have figured out a correct algorithm for the problem. But i keep on getting SIGSEV ,perhaps the recursion is going to deep. I have'nt been able to figure out how the iterative version will look loke( the one i made up isn't giving correct output). It would be helpful if somene could share. PS : in refrence to http://www.spoj.com/problems/GOODA/ Thanks in advance.