Re: [algogeeks] Re: SPOJ PROBLEM
@jhosimar : LONG_MAX ain't working :( , LONG_MAX + 1 returns a new number ne ideas?? thanx again On Sat, Feb 19, 2011 at 9:36 AM, Jhosimar Arias wrote: > Infinity in c++ you can use this -> std::cout << > std::numeric_limits::infinity ()< But for dijkstra you can represent infinity by a long value like INT_MAX or > LONG_MAX, not necesarily infinity. > > 2011/2/18 Akash Mukherjee > > hi, >> >> i have a slightly different but related probelm, i am trying to implement >> djiktra's in c++ & how should i deal with the infinity weights( i mean does >> c++ have infinity)? >> >> thanx in advance :) >> >> >> On Fri, Feb 18, 2011 at 10:16 PM, Balaji S wrote: >> >>> just output..unicode of infinity.. :) >>> >>> -- >>> 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 >>> algogeeks+unsubscr...@googlegroups.com. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> -- >> 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 >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: SPOJ PROBLEM
Infinity in c++ you can use this -> std::cout << std::numeric_limits::infinity ()< > hi, > > i have a slightly different but related probelm, i am trying to implement > djiktra's in c++ & how should i deal with the infinity weights( i mean does > c++ have infinity)? > > thanx in advance :) > > > On Fri, Feb 18, 2011 at 10:16 PM, Balaji S wrote: > >> just output..unicode of infinity.. :) >> >> -- >> 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 >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: SPOJ PROBLEM
hi, i have a slightly different but related probelm, i am trying to implement djiktra's in c++ & how should i deal with the infinity weights( i mean does c++ have infinity)? thanx in advance :) On Fri, Feb 18, 2011 at 10:16 PM, Balaji S wrote: > just output..unicode of infinity.. :) > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] KLEINBERG PROBLEM NO 17
Consider the following variation on the Interval SchedulingProblem. You have a processor that can operate 24 hours a day,every day. People submit requests to run daily jobs on theprocessor. Each such job comes with a start time and an end time;if the job is accepted to run on the processor, it must runcontinuously, every day, for the period between its start and endtimes. (Note that certain hobs can begin before midnight and endafter midnight; this makes for a type of situation different fromwhat we saw in the Interval Scheduling Problem). Given a list of n such jobs, you goal is to accept as many jobs aspossible (regardless of length), subject to the constraint that theprocessor can run at most on job at any given point in time.Provide an algorithm to do this with a running time that ispolynomial in n. You may assume for simplicity that no two jobshave the same start or end times. Example: Consider the following 4 jobs, specified by (start-time,emd-time) pairs: (6 P.M., 6 A.M), (9 P.M., 4 A.M.), (3 A.M., 2 P.M.), (1 P.M., 7P.M.). The optimal solution would be to pick the two jobs (9 P.M., 4A.M.) and (1 P.M., 7 P.M.), which can be scheduled withoutoverlapping. Analyze the running time complexity and prove the optimality ofthe algorithm you provide. -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Fwd: SANKALAN 2011:DUCSS Annual Technical Festival
don't take me wrongly. I tried doing the same but failed. that is why I asked. I know this is not the place to taunt anyone. On Sat, Feb 19, 2011 at 12:09 AM, kanika suri wrote: > u r really askin d way to format dis kinda msg or its a taunt?..If it is > den i would say its jus a promotional activity. We thot here ppl discuss on > technical topics so it wud b gr8 to enlighten ppl vd such fest whr ppl > compete n exchange knowledge. > > Sorry if we broke ne rule for the group. > > > On Fri, Feb 18, 2011 at 11:57 PM, Tushar Bindal wrote: > >> how can you send such well formatted messages on google groups??? >> >> On Fri, Feb 18, 2011 at 9:40 PM, kanika suri wrote: >> >>> >>> >>> >>> >>> >>> >>> Delhi University Computer Science Society >>> >>> presents >>> >>> >>> Sankalan 2011 >>> >>> >>> Annual Technical Festival >>> >>> on >>> >>> >>> 5th and 6th March 2011 >>> >>> >>>With open arms we welcome you >>> all. Come and join us in our >>> >>> >>> celebrations. >>> >>> Lots of fun and >>> many cash prizes to be won. >>> >>> >>> >>> Register For Techno Speak at >>> >>> technospeak2...@gmail.com >>> >>> >>> >>> For Further Details, Registration and Accommodation kindly visit : >>> >>> *http://cs.du.ac.in/sankalan2011* >>> >>> * >>> * >>> >>> *http://twitter.com/#!/Sankalan2011 >>> http://www.facebook.com/home.php#!/pages/Sankalan-2011/191073857576935* >>> >>> * >>> * >>> >>> Or >>> >>> You can mail to us at sankalan2...@gmail.com >>> >>> >>> *Registration is open till 20th February 2011 for techno speak. >>> >>> * >>> * >>> >>> * >>> * >>> >>> >>> >>> >>> >>> >>> >>> >>> >>> >>> >>> -- >>> 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 >>> algogeeks+unsubscr...@googlegroups.com. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> >> >> -- >> Tushar Bindal >> Computer Engineering >> Delhi College of Engineering >> Mob: +919818442705 >> E-Mail : tusharbin...@jugadengg.com >> >> -- >> 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 >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > regards > kanika suri > MCS 2nd yr > DUCS > University of Delhi > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tusharbin...@jugadengg.com -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Fwd: SANKALAN 2011:DUCSS Annual Technical Festival
u r really askin d way to format dis kinda msg or its a taunt?..If it is den i would say its jus a promotional activity. We thot here ppl discuss on technical topics so it wud b gr8 to enlighten ppl vd such fest whr ppl compete n exchange knowledge. Sorry if we broke ne rule for the group. On Fri, Feb 18, 2011 at 11:57 PM, Tushar Bindal wrote: > how can you send such well formatted messages on google groups??? > > On Fri, Feb 18, 2011 at 9:40 PM, kanika suri wrote: > >> >> >> >> >> >> >> Delhi University Computer Science Society >> >> presents >> >> >> Sankalan 2011 >> >> >> Annual Technical Festival >> >> on >> >> >> 5th and 6th March 2011 >> >> >>With open arms we welcome you all. >> Come and join us in our >> >> >> celebrations. >> >> Lots of fun and many >> cash prizes to be won. >> >> >> >> Register For Techno Speak at >> >> technospeak2...@gmail.com >> >> >> >> For Further Details, Registration and Accommodation kindly visit : >> >> *http://cs.du.ac.in/sankalan2011* >> >> * >> * >> >> *http://twitter.com/#!/Sankalan2011 >> http://www.facebook.com/home.php#!/pages/Sankalan-2011/191073857576935* >> >> * >> * >> >> Or >> >> You can mail to us at sankalan2...@gmail.com >> >> >> *Registration is open till 20th February 2011 for techno speak. >> >> * >> * >> >> * >> * >> >> >> >> >> >> >> >> >> >> >> >> -- >> 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 >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Tushar Bindal > Computer Engineering > Delhi College of Engineering > Mob: +919818442705 > E-Mail : tusharbin...@jugadengg.com > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- regards kanika suri MCS 2nd yr DUCS University of Delhi -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Fwd: SANKALAN 2011:DUCSS Annual Technical Festival
how can you send such well formatted messages on google groups??? On Fri, Feb 18, 2011 at 9:40 PM, kanika suri wrote: > > > > > > > Delhi University Computer Science Society > > presents > > > Sankalan 2011 > > > Annual Technical Festival > > on > > > 5th and 6th March 2011 > > >With open arms we welcome you all. > Come and join us in our > > > celebrations. > > Lots of fun and many > cash prizes to be won. > > > > Register For Techno Speak at > > technospeak2...@gmail.com > > > > For Further Details, Registration and Accommodation kindly visit : > > *http://cs.du.ac.in/sankalan2011* > > * > * > > *http://twitter.com/#!/Sankalan2011 > http://www.facebook.com/home.php#!/pages/Sankalan-2011/191073857576935* > > * > * > > Or > > You can mail to us at sankalan2...@gmail.com > > > *Registration is open till 20th February 2011 for techno speak. > > * > * > > * > * > > > > > > > > > > > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tusharbin...@jugadengg.com -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Directory Structure
use a tree. For the first N lines, build a tree accordingly. For the
next M lines search the tree. If miss, bump up the counter and add
the node.
On Feb 17, 7:53 am, Akshata Sharma wrote:
> On Unix computers, data is stored in directories. There is one root
> directory, and this might have several directories
> contained inside of it, each with di fferent names. These directories might
> have even more directories contained inside of them,
> and so on.
> A directory is uniquely identified by its name and its parent directory (the
> directory it is directly contained in). This is usually
> encoded in a path, which consists of several parts each preceded by a
> forward slash ('/'). The final part is the name of the
> directory, and everything else gives the path of its parent directory. For
> example, consider the path: /home/facebook/people
> This refers to the directory with name "people" in the directory described
> by "/home/facebook", which in turn refers to the
> directory with name "facebook" in the directory described by the path
> "/home". In this path, there is only one part, which means it
> refers to the directory with the name "home" in the root directory.
> To create a directory, you can use the mkdir command. You specify a path,
> and then mkdir wi ll create the directory described by
> that path, but only if the parent directory al ready exists. For example, i
> f you wanted to create the "/home/facebook/people" and
> "/home/facebook/tech" directories from scratch, you would need four
> commands:
> mkdir /home
> mkdir /home/facebook
> mkdir /home/facebook/people
> mkdir /home/facebook/tech
> Given the full set of directories already existing on your computer, and a
> set of new directories you want to create if they do not
> already exist, how many mkdir commands do you need to use?
>
> Input The first line of the input gives the number of test cases, T. T test
> cases follow. Each case begins with a line containing two
> integers N and M, separated by a space.
>
> The next N lines each give the path of one directory that already exists on
> your computer. This list will include every directory
> already on your computer other than the root directory. (The root directory
> is on every computer, so there is no need to l ist it
> explicitly.)
>
> The next M lines each give the path of one directory that you want to
> create.
> Each of the paths in the input is formatted as in the problem statement
> above. Speci fically, a path consists of one or more lower -
> case alpha-numeric strings (i .e., strings containing only the symbols
> 'a'-'z' and '0'-'9'), each preceded by a single forward slash.
> These alpha-numeric strings are never empty.
>
> Output For each test case, output one l ine containing "Case #x: y", where x
> is the case number (starting from 1) and y is the
> number of mkdir you need.
>
> Note: If a directory is listed as being on your computer, then its parent
> directory will also be listed, unless the parent is the root
> directory.
>
> INPUT
>
> 2
>
> 1 2
> /chicken
> /chicken/egg
> /chicken
>
> 1 3
> /a
> /a/b
> /a/c
> /b/b
>
> OUTPUT
>
> Case #1: 1
> Case #2: 4
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: SPOJ PROBLEM
just output..unicode of infinity.. :) -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Fwd: SANKALAN 2011:DUCSS Annual Technical Festival
Delhi University Computer Science Society presents Sankalan 2011 Annual Technical Festival on 5th and 6th March 2011 With open arms we welcome you all. Come and join us in our celebrations. Lots of fun and many cash prizes to be won. Register For Techno Speak at technospeak2...@gmail.com For Further Details, Registration and Accommodation kindly visit : *http://cs.du.ac.in/sankalan2011* * * *http://twitter.com/#!/Sankalan2011 http://www.facebook.com/home.php#!/pages/Sankalan-2011/191073857576935* * * Or You can mail to us at sankalan2...@gmail.com *Registration is open till 20th February 2011 for techno speak. * * * * -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] matrix(amazon)
use kadane 2D algo for first one -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] matrix(amazon)
Q-1)does any 1 know how to find a largest rectangular sub matrix in a binary matrix ( matrix contains only 0 & 1) Q-2) largest square submatrix in a matrix which contains both +ve and -ve elements... what if we have to find largest square sub-matrix of size k -- With Regards, *Jalaj Jaiswal* (+919019947895) Software developer, Cisco Systems B.Tech IIIT ALLAHABAD -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Matrix will Stuck..!!!!!!!!
Let f[r, c] denote the sum of rectangular subarray ofM with one corner at entry [1, 1] and the other at [r, c]. This can be computed in O(n2) time. Observe that the sum of any rectangular subarray of M can be computed in constant time given the table f. This yields an O(n4) algorithm; simply guess the lower-left and the upper-right corner of the rectangular subarray and use the f table to compute its sum. Here is how we can get O(n3) time. Recall that the maximum sum substring of a 1 dimensional array algorithm simply walks through the array one entry at a time and keeps a running total of the entries. If this total ever becomes negative then set it to 0. Output the largest of these totals. Use this as an auxiliary function to solve the two dimensional problem in the following way. Guess the top and bottom row r1 and r2 of the subarray. Using the table f computed previously and the maximum sum substring algorithm for 1 dimensional arrays we can determine the maximum sum rectangular subarray with top row r1 and bottom row r2 in linear time. On Fri, Feb 18, 2011 at 7:11 PM, DIPANKAR DUTTA wrote: > http://dsalgo.blogspot.com/2008/05/max-sum-sub-matrix.html > > > On Fri, Feb 18, 2011 at 7:10 PM, DIPANKAR DUTTA < > dutta.dipanka...@gmail.com> wrote: > >> http://dsalgo.blogspot.com/2006/07/maximum-sub-array-sum.html >> >> >> On Fri, Feb 18, 2011 at 2:51 AM, bittu 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 algogeeks@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com. >>> 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:dipan...@iitr.ernet.in >> >> > > > -- > 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:dipan...@iitr.ernet.in > > -- 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:dipan...@iitr.ernet.in -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Matrix will Stuck..!!!!!!!!
http://dsalgo.blogspot.com/2008/05/max-sum-sub-matrix.html On Fri, Feb 18, 2011 at 7:10 PM, DIPANKAR DUTTA wrote: > http://dsalgo.blogspot.com/2006/07/maximum-sub-array-sum.html > > > On Fri, Feb 18, 2011 at 2:51 AM, bittu 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 algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> 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:dipan...@iitr.ernet.in > > -- 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:dipan...@iitr.ernet.in -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Matrix will Stuck..!!!!!!!!
http://dsalgo.blogspot.com/2006/07/maximum-sub-array-sum.html On Fri, Feb 18, 2011 at 2:51 AM, bittu 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > 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:dipan...@iitr.ernet.in -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
