www.ams.jhu.edu/~castello/362/Handouts/*hungarian*.pdf
This PDF might be helpful
On Sunday, 16 September 2012 16:42:25 UTC+5:30, Rahul Kumar Patle wrote:
@atul: in Hungarian Algorithms works for minimization of cost where the
terminating condition is based on zeros.. in my problem what
Plz provide me efficeient sol. 4 thisthnx
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
contiguous or non-contiguous ?
On Tue, Sep 18, 2012 at 1:23 AM, rahul sharma rahul23111...@gmail.comwrote:
Plz provide me efficeient sol. 4 thisthnx
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
it wud give u continuous...subarray...if u want non continuous..question
shud be subsequence...and for that u need to all combination O(n^20..which
is offcourse bruteforce...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
make a sum array..such that..sum[i]=sum of number from 0 to i-1make a
node which has 2 data..sum[i] and ith index itself..sort this node array
according to sum[i]...now check for consecutive value which have same
value...corresponding index i,j to that sum nodes will be start and end of
