Help in this problem

Правка en1, от none__none, 2019-07-04 20:35:25

There is a NxM 2D matrix given .Each Cell contains a value.

We need to find the smallest number that can be reached from a cell but we are allowed to

go from one cell to its adjacent cell which share an edge and we can go

from one cell to another only if another cell value is strictly less than the

current cell. And we have to find this value for each cell.

e.g-

A=[[2 4 3 1] [2 1 5 0]]

result for the above is:

res=[[2 0 0 0] [1 1 0 0]]

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский none__none 2019-07-04 20:37:52 37 Tiny change: '[1 1 0 0]]' -> '[1 1 0 0]]\n\n\n0<=A[i]<=1000000\n1<= N,M<=1000'
en1 Английский none__none 2019-07-04 20:35:25 494 Initial revision (published)