Because of maintenance, it is currently impossible to submit any solutions.
The maintenance will end around 3:00 am GMT (4:00 am SPOJ time).
This message will disappear once the maintenance is finished.
SPOJ Problem Set (classical)
Problem code: ARRAYSUB
Given an array and an integer k, find the maximum for each and every contiguous subarray of size k.
the number n denoting number of elements in the array then after a new line we have the numbers of the array
and then k in a new line
1 <= k <=n
and each element of the array is between 0 and 10^6
print the output array
1 2 3 1 4 5 2 3 6
3 3 4 5 5 5 6