http://dsalgo.blogspot.com/2006/07/maximum-sub-array-sum.html
On Fri, Feb 18, 2011 at 2:51 AM, bittu shashank7andr...@gmail.com 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
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.comwrote:
http://dsalgo.blogspot.com/2006/07/maximum-sub-array-sum.html
On Fri, Feb 18, 2011 at 2:51 AM, bittu shashank7andr...@gmail.com wrote:
you have 2-d
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
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*
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
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.
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
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 akshatasharm...@gmail.com wrote:
On Unix computers, data is stored in directories. There is one root
directory,
how can you send such well formatted messages on google groups???
On Fri, Feb 18, 2011 at 9:40 PM, kanika suri surfatheig...@gmail.comwrote:
Delhi University Computer Science Society
presents
Sankalan 2011
Annual Technical Festival
on
5th and 6th March 2011
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
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 surfatheig...@gmail.comwrote:
u r really askin d way to format dis kinda msg or its a taunt?..If it is
den i would say its
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
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 balaji.ceg...@gmail.com wrote:
just output..unicode of
Infinity in c++ you can use this - std::cout
std::numeric_limitsdouble::infinity ()endl;
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 akash...@gmail.com
hi,
i have a slightly different but related
@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 jarias...@gmail.com wrote:
Infinity in c++ you can use this - std::cout
std::numeric_limitsdouble::infinity ()endl;
But for dijkstra you can
15 matches
Mail list logo
