r**u
发帖数: 1567 | 1 Imagin there is a square matrix with n x n cells. Each cell is either filled
with a black pixel or a white pixel. Design an algorithm to find the
maximum subsquare such that all four borders are filled with black pixels;
谢谢 | f****b
发帖数: 486 | 2 the problem is listed in the book from zhiyebei.
column by column scannning, then check the subcolumn for possible max square
, complexity O(n^2)
filled
【在 r**u 的大作中提到】
: Imagin there is a square matrix with n x n cells. Each cell is either filled
: with a black pixel or a white pixel. Design an algorithm to find the
: maximum subsquare such that all four borders are filled with black pixels;
: 谢谢
|
|
