C语言——找所有鞍点

#include<stdio.h>
int main(void)
{
	int i,j,n,a[6][6],max[6][6],min[6][6],index_1,index_2,count[2][6]={{1,1,1,1,1,1},{1,1,1,1,1,1}};
	
	scanf("%d",&n);
	for(i=0;i<n;i++){
		index_1=0;
		for(j=0;j<n;j++){
			scanf("%d",&a[i][j]);
			if(a[i][j]>a[i][index_1]) index_1=j;
		}
		max[i][0]=index_1;
		for(j=index_1+1;j<n;j++){
			if(a[i][j]==a[i][index_1]){
			   max[i][count[0][i]]=j;
			   count[0][i]++;
			}
		}
	}
	for(j=0;j<n;j++){
		index_2=0;
		for(i=0;i<n;i++){
			if(a[i][j]<a[index_2][j]) index_2=i;
		}
		min[0][j]=index_2;
		for(i=index_2+1;i<n;i++){
			if(a[i][j]==a[index_2][j]){
			   min[count[1][j]][j]=i;
			   count[1][j]++;
			}
		}
	}
	int count_=0;
    for(i=0;i<n;i++){
		for(j=0;j<count[0][i];j++){
			for(int x=0;x<count[1][max[i][j]];x++){
				if(min[x][max[i][j]]==i){
					 printf("%d %d\n",i,max[i][j]);
					 count_++;
				}
			}
		}
	}
	if(count_==0) printf("Not Found!");
	
	return 0;
}