http://dsalgo.blogspot.com/2008/05/max-sum-sub-matrix.html
On Fri, Feb 18, 2011 at 7:10 PM, DIPANKAR DUTTA <[email protected]>wrote: > http://dsalgo.blogspot.com/2006/07/maximum-sub-array-sum.html > > > On Fri, Feb 18, 2011 at 2:51 AM, bittu <[email protected]> wrote: > >> you have 2-d array, with m length and n width.You are also given k, >> ( k<=n && k<=m ). >> Now, select a square of size k, which returns maximum sum.In Minimum >> Time Complexity >> >> >> Thanks & Regards >> Shashank. >> >> >> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > DIPANKAR DUTTA > M-TECH,Computer Science & Engg. > E&C Dept,IIT ROORKEE > Uttarakhand , India – 247667 > ------------------------------------------- > website:http://people.iitr.ernet.in/shp/09535009/Website/index.html > ph no-09045809987 > Lab: 286454 > email:[email protected] > > -- DIPANKAR DUTTA M-TECH,Computer Science & Engg. E&C Dept,IIT ROORKEE Uttarakhand , India – 247667 ------------------------------------------- website:http://people.iitr.ernet.in/shp/09535009/Website/index.html ph no-09045809987 Lab: 286454 email:[email protected] -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
