c语言数组找鞍点,c语言找出一个二维数组的鞍点

#include

#include

#include

int main()

{ int n,i,j,k,maxh,maxj,a[8][8];

bool flag,yes;

srand(time(0));

scanf("%d",&n);

for(i=1; i<=n; ++i)

{ for (j=1; j<=n; ++j)

{ a[i][j]=rand()%10;

printf("%3d",a[i][j]);

}

printf("\n");

}

flag=false;

for(i=1; i<=n; ++i)

{ maxh=a[i][1];

maxj=1;

for (j=2; j<=n; ++j)

if (maxh

{ maxh=a[i][j];  //第i行上最大值 maxh

maxj=j;

}

for(j=maxj; j<=n; j++)

if(a[i][j]==maxh)//在此行上所有值为maxh的数

{ yes=true;

for (k=1; k<=n; ++k)

if (maxh>a[k][j])

{ yes=false;

break;

}

if(yes)

{ printf("%d %d %d\n",i,j,maxh);

flag=true;

}

}

}

if (!flag)

printf("not found\n");

return 0;

}