求n*n阶矩阵最大子矩阵阶数

int MaxSubMatrixOrder(int **a,int n){
	int result[n][n] = {a[0][0]};
	for(int i=1;i<n;i++){
		result[0][i] = a[0][i];
		result[i][0] = a[i][0];
	}
	int max = 0;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(a[i][j]==1){
				max = 1;
				break;
			}
		}
	}
	if(max==0) return 0;
	for(int i=1;i<n;i++){
		for(int j=1;j<n;j++){
			if(a[i][j]==0) result[i][j] = 0;
			else{
				if(result[i][j-1]==0||result[i-1][j]==0) {
					result[i][j] = 1;
					continue;
				}
				if(result[i][j-1]>=result[i-1][j]) result[i][j] = result[i-1][j];
				else result[i][j] = result[i][j-1];
				if(result[i-1][j-1]>0) result[i][j]++;
				if(max<result[i][j]) max = result[i][j];
			}
		}
	}
	return max;
}