#include<iostream>
#include<vector>
using namespace std;
int main()
{
int m, n;
while (cin >> m >> n)
{
vector<long> v;
long p;
int k = m*n;
while (k--&&cin >> p)
{
v.push_back(p);
}
long max = v[0];
int l=0;
for (int i = 1; i <=m*n - 1;++i)
if (abs(v[i])>abs(max))
max = v[i], l = i;
int r = l / n +1;//输出行列数有点费力
int c= (l+1)-(r-1)*n;
cout << r << ' ' << c<< ' ' << v[l] << endl;
}
return 0;
}
2022 海选女主角
最新推荐文章于 2020-09-14 20:28:12 发布