HDOJ-3415（单调队列）

题目：http://acm.hdu.edu.cn/showproblem.php?pid=3415

一看到题感觉就像得用单调队列的样子，因为手生，又说不出个所以然来，只要硬着头皮想想，对于每个数a[i]，我们如果能找出以它为起点或终点，元素个数不超过K个，和最大的连续序列，就好了，如果以a[i]为终点，则问题可以写成对a[i]找出{ sum[i] - sum[j], i-k <= j < i }的最大值，然后我们要是能很快的知道{ sum[j], i-k <= j < i }的最小值就好了，这个不就是每个K区间的最小值了吗，单调队列最初的作用呀O(∩_∩)O~

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAX	200005

int n, k, m, a[MAX], s[MAX] = {0};
struct Deque{
	int arr[MAX], head, tail;
	void clear(){
		head = tail = 0;
	}
	bool empty()const{
		return head == tail;
	}
	int size()const{
		return tail - head;
	}
	int back()const{
		return arr[tail-1];
	}
	void push_back(int x){
		arr[tail++] = x;
	}
	void pop_back(){
		--tail;
	}
	int front()const{
		return arr[head];
	}
	void pop_front(){
		++head;
	}
	void show()const{
		printf("deque:");
		for(int i = head; i < tail; ++i) printf(" %d", arr[i]);
		puts("");
	}
} Q;

int main()
{
	int kase, i, maxSum, start, end;
	for(scanf("%d", &kase); kase--; ){
		scanf("%d%d", &n, &k);
		for(i = 1; i <= n; ++i) scanf("%d", a + i);
		if(k == 1){
			i = max_element(a+1, a+n+1) - a;
			printf("%d %d %d\n", a[i], i, i);
			continue;
		}
		memcpy(a+n+1, a+1, (k-1)*sizeof(int));
		m = n+k-1;

		maxSum = 1 << 31;
		Q.clear();
		Q.push_back(0);
		for(i = 1; i <= m; ++i){
			s[i] = s[i-1] + a[i];
			if(maxSum < s[i] - s[Q.front()]){
				maxSum = s[i] - s[Q.front()];
				start = Q.front() + 1;
				end = i > n ? i % n : i;
			}
			while(!Q.empty() && s[Q.back()] > s[i]) Q.pop_back();//here equal should be kept
			Q.push_back(i);
			if(Q.front() + k <= i) Q.pop_front();
//			Q.show();
		}

		printf("%d %d %d\n", maxSum, start, end);
	}
	return 0;
}