求调
查看原帖
求调
1015482
huzixiao楼主2024/11/13 18:10
#include<iostream>
using namespace std;
int n, m;
int a[55][55];
int main() {
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> a[i][j];
		}
	}
	for (int I = 0; I < n; I++) {
		for (int J = 0; J < m; J++) {
			int far = 0;
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					if (a[I][J] == a[i][j]) {
						far = max(far, abs(I - i) * abs(I - i) + abs(J - j) * abs(J - j));
					}
				}
			}
			cout << far << " ";
		}
		cout << endl;
	}
	return 0;
}
2024/11/13 18:10
加载中...