SPOJ.com - Problem ARRAYSUB

ARRAYSUB - subarrays

#datastructures #sliding-window-1 #data-structure-1

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

n < 10^6
k < 10^5
1 <= k <= n

and each element of the array is between 0 and 10^6

(Edited: In fact, n <= 10^5)

print the output array

Input:
9
1 2 3 1 4 5 2 3 6
3

Output:
3 3 4 5 5 5 6

< Previous 14 15 16 17 18 19 20 21 22 23 24 Next >

	aristofanis: 2012-10-24 16:24:40 does an O(nk) solution pass? Answer: no, you have to use a special data structure Last edit: 2013-02-20 16:13:39
	Ravi Kumar: 2012-10-01 12:37:15 not even a single submission in python...why??
	Romal Thoppilan: 2012-07-08 12:32:01 Please improve on your testcases .. and rejudge
	mahesh: 2012-07-02 18:29:13 @ priyamehtanit... check my code.. its segsev in 5th test case.c my id is 7249031
	mahesh: 2012-07-02 18:29:12 @ priyamehtanit... check my code.. its segsev in 5th test case.c my id is 7249031
	mahesh: 2012-07-02 18:27:01 while 5th test case running its showing as segmentation fault.. any one knows why??
	spock: 2012-06-26 08:49:07 OMG...finally.. : well brute force or any modifications to it won't work. you have to think of a data structure to hold these values. Last edit: 2012-06-30 12:19:07
	vishal chaudhary: 2012-06-01 08:15:37 OKAY....:)
	:D: 2012-06-01 06:15:17 Obviously case like N=K=10 meets all three constraints. And don't use "what the hell" just because you didn't understand the problem. Be polite!
	vishal chaudhary: 2012-05-31 18:20:23 question says that...n<10^6 and ..k<10^5. then why is "=" in the line..1 <= k <=n b/w k and n...:\ Last edit: 2012-06-01 08:13:33