题目&思路:
代码:
import java.util.Scanner;
public class LargestSquare {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int H = cin.nextInt();
int W = cin.nextInt();
int map[][] = new int[H][W];
for (int i=0;i<H;i++){
for (int j=0;j<W;j++){
map[i][j] = cin.nextInt();
}
}
int max_val =0;
int dp[][] = new int[H][W];
for (int i=0;i<H;i++){
for (int j=0;j<W;j++){
if (map[i][j]==1){
dp[i][j] = 0;
}
else if(i==0 || j==0){
dp[i][j] = 1;
}
else {
dp[i][j] = Math.min(Math.min(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1]) + 1;
}
if (dp[i][j]>max_val){
max_val = dp[i][j];
}
}
}
System.out.println(max_val*max_val);
}
}
输入:
4 5
0 0 1 0 0
1 0 0 0 0
0 0 0 1 0
0 0 0 1 0
输出:
4