``` #include <iostream> #include <vector> #include <deque> #include <climits> using namespace std; template<typename Comparator> vector<int> sliding_window(const vector<int>& arr, int k, Comparator comp) { deque<int> dq; vector<int> res; for (int i = 0; i < arr.size(); ++i) { while (!dq.empty() && comp(arr[i], arr[dq.back()])) { dq.pop_back(); } dq.push_back(i); while (!dq.empty() && dq.front() <= i - k) { dq.pop_front(); } if (i >= k - 1) { res.push_back(arr[dq.front()]); } } return res; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int a, b, n; cin >> a >> b >> n; if (n == 1) { cout << 0 << endl; return 0; } vector<vector<int>> matrix(a, vector<int>(b)); for (int i = 0; i < a; ++i) { for (int j = 0; j < b; ++j) { cin >> matrix[i][j]; } } // 处理每一行，得到row_max和row_min vector<vector<int>> row_max(a); vector<vector<int>> row_min(a); auto max_comp = [](int a, int b) { return a >= b; }; auto min_comp = [](int a, int b) { return a <= b; }; for (int i = 0; i < a; ++i) { row_max[i] = sliding_window(matrix[i], n, max_comp); row_min[i] = sliding_window(matrix[i], n, min_comp); } // 处理列方向，得到最终的max_val和min_val int cols = row_max[0].size(); int final_rows = a - n + 1; vector<vector<int>> max_val(final_rows, vector<int>(cols)); vector<vector<int>> min_val(final_rows, vector<int>(cols)); for (int j = 0; j < cols; ++j) { vector<int> col_max, col_min; for (int i = 0; i < a; ++i) { col_max.push_back(row_max[i][j]); col_min.push_back(row_min[i][j]); } vector<int> res_max = sliding_window(col_max, n, max_comp); vector<int> res_min = sliding_window(col_min, n, min_comp); for (int i = 0; i < final_rows; ++i) { max_val[i][j] = res_max[i]; min_val[i][j] = res_min[i]; } } // 计算最小差值 int result = INT_MAX; for (int i = 0; i < final_rows; ++i) { for (int j = 0; j < cols; ++j) { int diff = max_val[i][j] - min_val[i][j]; if (diff < result) { result = diff; } } } cout << result << endl; return 0; }```template<typename Comparator> 的作用 再解释一下vector<int> sliding_window