fork download
  1. m,n=map(int,input().split())
  2. A=[]
  3. for i in range(0,m):
  4. B=list(map(int,input().split()))
  5. A.append(B)
  6.  
  7. dodai = 0
  8.  
  9. for i in range(0,m):
  10. for j in range(0,n):
  11. for k in range(1, n): #độ dài cạnh
  12. if i + k - 1 < m and j + k - 1 < n:
  13. x = i
  14. y = j #tọa độ góc trên (x, y)
  15. u = i + k - 1
  16. v = j + k - 1 # tọa độ góc dưới (u, v)
  17.  
  18. bangNhau = True
  19. for a in range(x, u + 1):
  20. for b in range(y, v + 1):
  21. if A[a][b] != A[x][y]:
  22. bangNhau = False
  23.  
  24. if bangNhau == True:
  25. #thỏa mãn
  26. dodai = max(dodai, k)
  27. print(dodai)
Success #stdin #stdout 0.03s 9844KB
stdin
11 13
0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 1 1 1 0 0 0 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
0 1 1 1 1 1 1 1 1 1 0 0 0
1 1 1 1 1 1 1 1 1 1 1 0 0
0 1 1 1 1 1 1 1 1 1 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
0 0 0 0 1 1 1 0 0 0 0 1 1
0 0 0 0 0 1 0 0 0 0 0 1 1
stdout
7