fork download
copy 
  1. #include <iostream>
  2. #include <vector>
  3. #include <algorithm>
  4.  
  5. using namespace std;
  6.  
  7. int main() {
  8.     int m, n;
  9.     cin >> m >> n;
  10.  
  11.     vector<vector<int>> mat(m, vector<int>(n));
  12.  
  13.     // Nhập ma trận
  14.     for (int i = 0; i < m; ++i) {
  15.         for (int j = 0; j < n; ++j) {
  16.             cin >> mat[i][j];
  17.         }
  18.     }
  19.  
  20.     vector<vector<int>> dp(m, vector<int>(n, 0));
  21.     int maxSide = 0;
  22.  
  23.     // Tính toán dp
  24.     for (int i = 0; i < m; ++i) {
  25.         for (int j = 0; j < n; ++j) {
  26.             if (i == 0 || j == 0) {
  27.                 dp[i][j] = mat[i][j];
  28.             } else if (mat[i][j] == mat[i-1][j] && mat[i][j] == mat[i][j-1] && mat[i][j] == mat[i-1][j-1]) {
  29.                 dp[i][j] = min({dp[i-1][j], dp[i][j-1], dp[i-1][j-1]}) + 1;
  30.             } else {
  31.                 dp[i][j] = mat[i][j];
  32.             }
  33.             maxSide = max(maxSide, dp[i][j]);
  34.         }
  35.     }
  36.  
  37.     cout << maxSide * maxSide << endl;
  38.  
  39.     return 0;
  40. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
4 5
1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
stdout
copy 
4
https://ideone.com/AWEHXq
language:
C++14 (gcc 8.3)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!