// C++ program for the above approach
 
#include <bits/stdc++.h>
using namespace std;
 
// Method to find the maximum for each
// and every contiguous subarray of size K.
void printKMax(int arr[], int N, int K)
{
	int j, max;
 
	for (int i = 0; i <= N - K; i++) {
		max = arr[i];
 
		for (j = 1; j < K; j++) {
			if (arr[i + j] > max)
				max = arr[i + j];
		}
		cout << max << " ";
	}
}
 
// Driver's code
int main()
{
	int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
	int N = sizeof(arr) / sizeof(arr[0]);
	int K = 3;
 
	// Function call
	printKMax(arr, N, K);
	return 0;
}
 

Ly8gQysrIHByb2dyYW0gZm9yIHRoZSBhYm92ZSBhcHByb2FjaAoKI2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgovLyBNZXRob2QgdG8gZmluZCB0aGUgbWF4aW11bSBmb3IgZWFjaAovLyBhbmQgZXZlcnkgY29udGlndW91cyBzdWJhcnJheSBvZiBzaXplIEsuCnZvaWQgcHJpbnRLTWF4KGludCBhcnJbXSwgaW50IE4sIGludCBLKQp7CglpbnQgaiwgbWF4OwoKCWZvciAoaW50IGkgPSAwOyBpIDw9IE4gLSBLOyBpKyspIHsKCQltYXggPSBhcnJbaV07CgoJCWZvciAoaiA9IDE7IGogPCBLOyBqKyspIHsKCQkJaWYgKGFycltpICsgal0gPiBtYXgpCgkJCQltYXggPSBhcnJbaSArIGpdOwoJCX0KCQljb3V0IDw8IG1heCA8PCAiICI7Cgl9Cn0KCi8vIERyaXZlcidzIGNvZGUKaW50IG1haW4oKQp7CglpbnQgYXJyW10gPSB7IDEsIDIsIDMsIDQsIDUsIDYsIDcsIDgsIDksIDEwIH07CglpbnQgTiA9IHNpemVvZihhcnIpIC8gc2l6ZW9mKGFyclswXSk7CglpbnQgSyA9IDM7CgoJLy8gRnVuY3Rpb24gY2FsbAoJcHJpbnRLTWF4KGFyciwgTiwgSyk7CglyZXR1cm4gMDsKfQo=