水题求解

#include <iostream>
#include <climits>
using namespace std;
int n, a[10001] = {}, k, mx1[1001] = {}, mi1[1001] = {}, mx = -10000, mi = INT_MAX;
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	cin >> k;
	for (int i = 1; i <= n; i++) {
		mi = INT_MAX;
		for (int j = i; j <= i + k - 1; j++) {
			mi = min(a[j], mi);
			mx = max(a[j], mx);
			mi1[i] = mi;
			mx1[i] = mx;
		}
	}
	for (int i = 1; i <= n - k + 1; i++) cout << mi1[i] << " ";
	cout << endl;
	for (int i = 1; i <= n - k + 1; i++) cout << mx1[i] << " ";
	return 0;
}