#include#define N 3#define M 4void main() { int a[N][M],i,j,mi,mj; for ( i=0;i mi=mj=0; for ( i=0;i printf("矩阵中最大值%d，位于第%d行第%d列\n",a[mi][mj],mi+1,mj+1);}
