HDU - 5806 NanoApe Loves Sequence Ⅱ（尺取）

NanoApe, the Retired Dog, has returned back to prepare for for the National Higher Education Entrance Examination! 

In math class, NanoApe picked up sequences once again. He wrote down a sequence with nn numbers and a number mm on the paper. 

Now he wants to know the number of continous subsequences of the sequence in such a manner that the kk-th largest number in the subsequence is no less than mm. 

Note : The length of the subsequence must be no less than kk.

 

Input

The first line of the input contains an integer TT, denoting the number of test cases. 

In each test case, the first line of the input contains three integers n,m,kn,m,k. 

The second line of the input contains nn integers A1,A2,...,AnA1,A2,...,An, denoting the elements of the sequence. 

1≤T≤10, 2≤n≤200000, 1≤k≤n/2, 1≤m,Ai≤1091≤T≤10, 2≤n≤200000, 1≤k≤n/2, 1≤m,Ai≤109

 

Output

For each test case, print a line with one integer, denoting the answer.

 

Sample Input

1
7 4 2
4 2 7 7 6 5 1

Sample Output

18

 

题目大意：一个长度为n的序列，求出所有符合条件的连续的子序列的个数（子序列的第K大的数不小于m)

解题思路：可以使用尺取法来做，从左往右遍历，用一个变量t来记录不小于m的个数，当t>=k时，此时符合条件的来序列为n-j+1,这是因为当后面还有数比m大时，显然第k大的数一定不小于m，当后面所有的数有比m小的时，依然有第k大的数不小于m ，所以从当前一次往后取数形成的子序列都符合条件。

注意：输入数据过大，使用cin会超时，使用scanf

AC代码；

#include<iostream>
using namespace std;
const int maxn=2e5+10;
int main()
{
	int num[maxn];
	int t,m,n,k;
	cin>>t;
	while(t--)
	{
		cin>>n>>m>>k;
		long long ans=0;
		int i=0,j=0,t=0;
		for(i=0;i<n;i++)
			scanf("%d",&num[i]);
		for(i=0;i<n;i++)
		{
			while(j<n&&t<k)
			{
				if(num[j]>=m)
					t++;
				j++;
			}
			if(t>=k)
				ans+=n-j+1;
			if(num[i]>=m)
				t--;
		}
		cout<<ans<<endl;
	}
	return 0; 
}