Sliding Window Algorithms and problems related to that..

See the code

Amortized complexity is O(n).

Problems to Solve:

• http://www.spoj.com/problems/ARRAYSUB/
• Task "sound" at http://www.boi2007.de/en/tasks
• Task "pyramid" at http://olympiads.win.tue.nl/ioi/ioi2006/contest/day1/ (medium to hard problem)
• http://wcipeg.com/problem/ccc03s2p5
• http://wcipeg.com/problem/ccc96s5
• http://wcipeg.com/problem/smac081p3
• http://wcipeg.com/problem/ccc96s5
• http://wcipeg.com/problem/ioi0611
• http://www.spoj.com/problems/BROKEN/
• http://www.spoj.com/problems/FSEATS/
• http://www.spoj.com/problems/KPMATRIX/
• http://www.spoj.com/problems/MATRIX2/
• http://www.codechef.com/problems/CHEFTOWN
• http://wcipeg.com/problem/ioi0612
• http://www.codechef.com/OCT12/problems/TEAMSIZE
• http://www.spoj.com/problems/KRECT/

References:

1. http://people.cs.uct.ac.za/~ksmith/articles/sliding_window_minimum.html
2. http://softwarelearner.blogspot.in/2011/04/minima-in-sliding-window.html
3. http://stackoverflow.com/questions/8269916/what-is-sliding-window-algorithm-examples/8269948#8269948
4. http://richardhartersworld.com/cri/2001/slidingmin.html
5. http://wcipeg.com/wiki/Sliding_window
6. http://www.geeksforgeeks.org/maximum-of-all-subarrays-of-size-k/
7. http://wcipeg.com/wiki/Sliding_range_minimum_query