二维数组的应用（二）--擂台法

//擂台法

int max, clu=0, row=0;
int a[3][2] = { {1,15},{903,3},{48,95} };
int i ,j;
max = a[0][0];
for ( i = 0; i < 3; i++)
	for ( j = 0; j < 2; j++)
		if (a[i][j]>max)
		{
			max = a[i][j];
			row = i;
			clu = j;

		}
		printf("max = %d\nrow = %d\nclu = %d\n", max, row, clu);