Skip to main content
Computer Science

Return to Question

improved formatting and grammar, added related tag
Source Link
edit approved Jun 4, 2018 at 13:00
xskxzr
edit approved Jun 4, 2018 at 13:00
xskxzr
  • 7.6k
  • 5
  • 23
  • 47

Given a n*mSuppose we are given an $n\times m$ matrix, M $M$ of positive integers. Here, theThe adjacent cells of a particular cell is the up, down, left and right cells. Like for cell M[i][j]$M[i][j]$ the adjacent cells are M[i-1][j]$M[i-1][j]$, M[i+1][j]$M[i+1][j]$, M[i][j-1]$M[i][j-1]$ and M[i][j+1]$M[i][j+1]$ respectively.

An area is a set of cells such that for each pair of cells $(u_0,v)$ in the area, there is a sequence of cells $u_1,\ldots,u_k$ in the area such that $u_{i+1}$ is an adjacent cell of $u_i$ and $u_k$ is an adjacent cell of $v$. The problem is to find out a maximum area  (i.e. an area with maximum number of adjacent cells) of this matrix which contains exactly two different numbers.

For an example: M = \begin{bmatrix}5&3&2&5&5\\2&1&2&5&3\\6&1&5&2&5\\5&2&5&3&5\\4&6&8&9&6\end{bmatrix}$$M=\begin{bmatrix}5&3&2&5&5\\2&1&2&5&3\\6&1&5&2&5\\5&2&5&3&5\\4&6&8&9&6\end{bmatrix},$$ Here the maximum area contains 10 cells. And the area is: \begin{bmatrix}*&*&2&5&5\\*&*&2&5&*\\*&*&5&2&*\\5&2&5&*&*\\*&*&*&*&*\end{bmatrix}$$\begin{bmatrix}*&*&2&5&5\\*&*&2&5&*\\*&*&5&2&*\\5&2&5&*&*\\*&*&*&*&*\end{bmatrix}.$$ What is the most efficient way to find the maximum area?

Given a n*m matrix, M of positive integers. Here, the adjacent cells of a particular cell is the up, down, left and right cells. Like for cell M[i][j] the adjacent cells are M[i-1][j], M[i+1][j], M[i][j-1] and M[i][j+1] respectively.

The problem is to find out a maximum area(i.e. maximum number of adjacent cells) of this matrix which contains exactly two different numbers.

For an example: M = \begin{bmatrix}5&3&2&5&5\\2&1&2&5&3\\6&1&5&2&5\\5&2&5&3&5\\4&6&8&9&6\end{bmatrix} Here the maximum area contains 10 cells. And the area is: \begin{bmatrix}*&*&2&5&5\\*&*&2&5&*\\*&*&5&2&*\\5&2&5&*&*\\*&*&*&*&*\end{bmatrix} What is the most efficient way to find the maximum area?

Suppose we are given an $n\times m$ matrix $M$ of positive integers. The adjacent cells of a particular cell is the up, down, left and right cells. Like for cell $M[i][j]$ the adjacent cells are $M[i-1][j]$, $M[i+1][j]$, $M[i][j-1]$ and $M[i][j+1]$ respectively.

An area is a set of cells such that for each pair of cells $(u_0,v)$ in the area, there is a sequence of cells $u_1,\ldots,u_k$ in the area such that $u_{i+1}$ is an adjacent cell of $u_i$ and $u_k$ is an adjacent cell of $v$. The problem is to find out a maximum area  (i.e. an area with maximum number of cells) of this matrix which contains exactly two different numbers.

For an example: $$M=\begin{bmatrix}5&3&2&5&5\\2&1&2&5&3\\6&1&5&2&5\\5&2&5&3&5\\4&6&8&9&6\end{bmatrix},$$ Here the maximum area contains 10 cells. And the area is: $$\begin{bmatrix}*&*&2&5&5\\*&*&2&5&*\\*&*&5&2&*\\5&2&5&*&*\\*&*&*&*&*\end{bmatrix}.$$ What is the most efficient way to find the maximum area?

added 1 character in body
Source Link
Soumen
Soumen
  • 69
  • 5

Given a n*m matrix, M of positive integers. Here, the adjacent cells of a particular cell is the up, down, left and right cells. Like for cell M[i][j] the adjacent cells are M[i-1][j], M[i+1][j], M[i][j-1] and M[i][j+1] respectively. The

The problem is to find out a maximum area(i.e. maximum number of adjacent cells) of this matrix which contains exactly two different numbers.

For an example: M = [[5, 3, 2, 5, 5], [2, 1, 2, 5, 3], [6, 1, 5, 2, 5], [5, 2, 5, 3, 5], [4, 6, 8, 9, 6]]\begin{bmatrix}5&3&2&5&5\\2&1&2&5&3\\6&1&5&2&5\\5&2&5&3&5\\4&6&8&9&6\end{bmatrix} Here the maximum area contains 10 cells. And the area is: [[., ., 2, 5, 5], [., ., 2, 5, .], [., ., 5, 2, .], [5, 2, 5, ., .],\begin{bmatrix}*&*&2&5&5\\*&*&2&5&*\\*&*&5&2&*\\5&2&5&*&*\\*&*&*&*&*\end{bmatrix} [., ., ., ., .]]

WhatWhat is the most efficient way to find the maximum area?

Given a n*m matrix, M of positive integers. Here, the adjacent cells of a particular cell is the up, down, left and right cells. Like for cell M[i][j] the adjacent cells are M[i-1][j], M[i+1][j], M[i][j-1] and M[i][j+1] respectively. The problem is to find out a maximum area(i.e. maximum number of adjacent cells) of this matrix which contains exactly two different numbers.

For an example: M = [[5, 3, 2, 5, 5], [2, 1, 2, 5, 3], [6, 1, 5, 2, 5], [5, 2, 5, 3, 5], [4, 6, 8, 9, 6]] Here the maximum area contains 10 cells. And the area is: [[., ., 2, 5, 5], [., ., 2, 5, .], [., ., 5, 2, .], [5, 2, 5, ., .], [., ., ., ., .]]

What is the most efficient way to find the maximum area?

Given a n*m matrix, M of positive integers. Here, the adjacent cells of a particular cell is the up, down, left and right cells. Like for cell M[i][j] the adjacent cells are M[i-1][j], M[i+1][j], M[i][j-1] and M[i][j+1] respectively.

The problem is to find out a maximum area(i.e. maximum number of adjacent cells) of this matrix which contains exactly two different numbers.

For an example: M = \begin{bmatrix}5&3&2&5&5\\2&1&2&5&3\\6&1&5&2&5\\5&2&5&3&5\\4&6&8&9&6\end{bmatrix} Here the maximum area contains 10 cells. And the area is: \begin{bmatrix}*&*&2&5&5\\*&*&2&5&*\\*&*&5&2&*\\5&2&5&*&*\\*&*&*&*&*\end{bmatrix} What is the most efficient way to find the maximum area?

added 1 character in body
Source Link
Soumen
Soumen
  • 69
  • 5

Given a n*m matrix, M of positive integers. Here, the adjacent cells of a particular cell is the up, down, left and right cells. Like for cell M[i][j] the adjacent cells are M[i-1][j], M[i+1][j], M[i][j-1] and M[i][j+1] respectively. The problem is to find out a maximum area(i.e. maximum number of adjacent cells) of this matrix which contains exactly two different numbers.

For an example: M = [[5, 3, 2, 5, 5], [2, 1, 2, 5, 3], [6, 1, 5, 2, 5], [5, 2, 5, 3, 5], [4, 6, 8, 9, 6]] HerHere the maximum area contains 10 cells. And the area is: [[*[[., , 2, 5, 5], [., *2, 5, 5], [., ., 2, 5, ], [.], * [., ., 5, 2, *].], [5, 2, 5, *., ], [.], * [., *., *., *]]., .]]

What is the most efficient way to find the maximum area?

Given a n*m matrix, M of positive integers. Here, the adjacent cells of a particular cell is the up, down, left and right cells. Like for cell M[i][j] the adjacent cells are M[i-1][j], M[i+1][j], M[i][j-1] and M[i][j+1] respectively. The problem is to find out a maximum area(i.e. maximum number of adjacent cells) of this matrix which contains exactly two different numbers.

For an example: M = [[5, 3, 2, 5, 5], [2, 1, 2, 5, 3], [6, 1, 5, 2, 5], [5, 2, 5, 3, 5], [4, 6, 8, 9, 6]] Her the maximum area contains 10 cells. And the area is: [[*, , 2, 5, 5], [, *, 2, 5, ], [, *, 5, 2, *], [5, 2, 5, *, ], [, *, *, *, *]]

What is the most efficient way to find the maximum area?

Given a n*m matrix, M of positive integers. Here, the adjacent cells of a particular cell is the up, down, left and right cells. Like for cell M[i][j] the adjacent cells are M[i-1][j], M[i+1][j], M[i][j-1] and M[i][j+1] respectively. The problem is to find out a maximum area(i.e. maximum number of adjacent cells) of this matrix which contains exactly two different numbers.

For an example: M = [[5, 3, 2, 5, 5], [2, 1, 2, 5, 3], [6, 1, 5, 2, 5], [5, 2, 5, 3, 5], [4, 6, 8, 9, 6]] Here the maximum area contains 10 cells. And the area is: [[., ., 2, 5, 5], [., ., 2, 5, .], [., ., 5, 2, .], [5, 2, 5, ., .], [., ., ., ., .]]

What is the most efficient way to find the maximum area?

Source Link
Soumen
Soumen
  • 69
  • 5