Subsequence

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

题意 ：我们需要选择出一段最大的子序列长度 ，满足 最大值减最小值大于m 并且要小于k;

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+100;
int a[maxn];
deque<int>q1;
deque<int>q2;
int main(){
	int n,m,k;
	while(cin>>n>>m>>k){
		int ans=0,last=0;
		for(int i=1;i<=n;i++)cin>>a[i];
		while(!q1.empty())q1.pop_front();
		while(!q2.empty())q2.pop_front();
		for(int i=1;i<=n;i++){
			while(!q1.empty()&&a[i]>=a[q1.back()])q1.pop_back();//降序   
			while(!q2.empty()&&a[i]<=a[q2.back()])q2.pop_back();//升序 
			q1.push_back(i);
			q2.push_back(i);
			while(!q1.empty()&&!q2.empty()&&a[q1.front()]-a[q2.front()]>k){//任意选择一个最前的一个最大值或者最小值 
				if(q1.front()<q2.front()){
					last=q1.front();
					q1.pop_front(); 
				}else{
					last=q2.front();
					q2.pop_front(); 
				}
			}
			//现在的这一段东西肯定是 小于K 的一段值 
			if(!q1.empty()&&!q2.empty()&&a[q1.front()]-a[q2.front()]>=m){//遍历跑 里面的东西 大于 m的最大长度； 
				ans=max(ans,i-last);
			}
		}
		cout<<ans<<endl;
	} 
}