hdoj3530Subsequence【单调队列】

Subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5271    Accepted Submission(s): 1739 Problem Description There is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum element of the subsequence is no smaller than m and no larger than k.   Input There are multiple test cases. For each test case, the first line has three integers, n, m and k. n is the length of the sequence and is in the range [1, 100000]. m and k are in the range [0, 1000000]. The second line has n integers, which are all in the range [0, 1000000]. Proceed to the end of file.   Output For each test case, print the length of the subsequence on a single line.   Sample Input 5 0 0 1 1 1 1 1 5 0 3 1 2 3 4 5   Sample Output 5 4

题意：在一个队列中求一个最长子序列使得该子序列满足最大值与最小值的差大于k小于m求该子序列的最大长度

分别设两个单调队列非别为递增递减求最长长度即可没做单调队列之前以为神秘看了之后还挺好理解的

单调队列：http://blog.csdn.net/justmeh/article/details/5844650

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=100010;
int a[maxn];
int que1[maxn];//单调递减队列 
int que2[maxn];//单调递增队列 
int MAX(int a,int b){
	return a>b?a:b;
}
int MIN(int a,int b){
	return a<b?a:b;
}
int main()
{
	int n,k,m,i,j,ans,now;
	int front1,rear1,front2,rear2;
	while(scanf("%d%d%d",&n,&m,&k)!=EOF){
		front1=rear1=front2=rear2=0;ans=0;now=1;
		for(i=1;i<=n;++i){
			scanf("%d",&a[i]);
			while(front1<rear1&&a[que1[rear1-1]]<a[i])rear1--;//插入队尾 
			while(front2<rear2&&a[que2[rear2-1]]>a[i])rear2--;
			que1[rear1++]=i;que2[rear2++]=i;
			while(front1<rear1&&front2<rear2&&a[que1[front1]]-a[que2[front2]]>k){//删除队首 
				if(que1[front1]<que2[front2])now=que1[front1++]+1;
				else now=que2[front2++]+1;
			}
			if(front1<rear1&&front2<rear2&&a[que1[front1]]-a[que2[front2]]>=m){
				if(ans<i-now+1)ans=i-now+1;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}