最匹配矩阵

解题思路:

注意事项:

参考代码:

#include<iostream>

#include<vector>

#include<utility>

using namespace std;

int Difference(vector<vector<int>>& matrix_1, vector<vector<int>>& matrix_2, int rows, int cols);

pair <int, int> FindMin(vector<vector<int>>& vec);

int main()

{

int m, n;

cin >> m >> n;

vector<vector<int>>origin_matrix;

origin_matrix.resize(m);

for (int i = 0; i < m; i++) {

for (int j = 0; j < n; j++) {

int temp;

cin >> temp;

origin_matrix[i].push_back(temp);

}

}

int r, s;

cin >> r >> s;

vector<vector<int>>judge_matrix;

judge_matrix.resize(r);

for (int i = 0; i < r; i++) {

for (int j = 0; j < s; j++) {

int temp;

cin >> temp;

judge_matrix[i].push_back(temp);

}

}

vector<vector<int>>result;

result.resize(m - r + 1);

for (int i = 0; i <= m - r; i++) {

for (int j = 0; j <= n - s; j++)

result[i].push_back(Difference(origin_matrix, judge_matrix, i, j));

}

int index_r = (FindMin(result)).first;

int index_c = (FindMin(result)).second;

/*cout << index_r << endl;

cout << index_c << endl;*/

//cout << Difference(origin_matrix, judge_matrix, 1, 0);

for (int i = index_r; i < index_r + r; i++) {

for (int j = index_c; j < index_c + s; j++) {

cout << origin_matrix[i][j] << " ";

}

cout << endl;

}

return 0;

}

int Difference(vector<vector<int>>& matrix_1, vector<vector<int>>& matrix_2, int rows, int cols)

{

int result = 0;

int counter_r = 0;

for (int i = rows; i < matrix_2.size() + rows; i++) {

int counter_c = 0;

for (int j = cols; j < matrix_2[0].size() + cols; j++) {

result += abs(matrix_1[i][j] - matrix_2[counter_r][counter_c]);

counter_c++;

}

counter_r++;

}

return result;

}

pair <int, int> FindMin(vector<vector<int>>& vec)

{

int index_r = 0;

int index_c = 0;

int min = vec[0][0];

for (int i = 0; i < vec.size(); i++) {

for (int j = 0; j < vec[0].size(); j++) {

if (vec[i][j] <= min) {

index_r = i;

index_c = j;

min = vec[i][j];

}

}

}

pair<int, int>result;

result = make_pair(index_r, index_c);

return result;

}