-1][j-1] + (sum[i-1][j] - sum[i-1][j-1]) + (sum[i][j-1]
- sum[i-1][j-1])+ip[i][j]
[smaller rect] [that row sum value][that
col sum value]
On Sun, Aug 12, 2012 at 8:54 PM, Srividhya Sampath
srisam261...@gmail.com wrote:
@vicky
can yo explain the logic behind
, Aug 11, 2012 at 7:10 PM, Srividhya srisam261...@gmail.com wrote:
hi all:)
The coordinates of a rectangle will be specified. there is a matrix of
integers. yo should find the sum of the integers that fall in the region
specified by the coordinates .
The solution to be in constant time
algog...@gmail.com wrote:
Sum of the integers meaning? Do you mind giving an example test case?
regards.
On Sat, Aug 11, 2012 at 7:10 PM, Srividhya srisam261...@gmail.comwrote:
hi all:)
The coordinates of a rectangle will be specified. there is a matrix of
integers. yo should find the sum
with the logic.
On Sun, Aug 12, 2012 at 6:27 PM, Srividhya Sampath srisam261...@gmail.com
wrote:
@ Vicky
Can yo explain with an illustration ?
On Sat, Aug 11, 2012 at 10:07 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
May be you can consider creating a 2d array to pre process and store
hi all:)
The coordinates of a rectangle will be specified. there is a matrix of
integers. yo should find the sum of the integers that fall in the region
specified by the coordinates .
The solution to be in constant time .
--
You received this message because you are subscribed to the Google
hi frnds..can any of you pls tell how to cut strings in optimal
time..in dynamic programming..
thanx:)
--
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
