cpp
复制代码
void 矩阵找最大小所在位置()
{//缘由https://ask.csdn.net/questions/7834783
int a[5][5]={1, 4, 7, 8, 5
, 2, 3, 6, 9, 11
, 12, 13, 15, 18, 19
, 41, 48, 43, 25, 47
, 26, 34, 39, 38, 17}
, d[3]{}, z[3]{}, x = 0, y = 0;
d[0] = z[0] = a[0][0];
while (y < 5)
{
if (a[y][x]>d[0])
d[0] = a[y][x], d[1] = y, d[2] = x; else;
if (a[y][x]<z[0])
z[0] = a[y][x], z[1] = y, z[2] = x; else;
if (++x < 5); else ++y, x = 0;
}
std::cout << "最大值" << d[0] << "行" << d[1] << "列" << d[2]
<< "\n最小值" << z[0] << "行" << z[1] << "列" << z[2] << "\n";
}