NanoApe Loves Sequence Ⅱ （尺取法）

最新推荐文章于 2020-06-26 23:18:32 发布

本该如此

最新推荐文章于 2020-06-26 23:18:32 发布

阅读量280

点赞数

分类专栏：数学 OJ刷题

本文链接：https://blog.csdn.net/qq_40922859/article/details/81350998

版权

OJ刷题同时被 2 个专栏收录

62 篇文章 1 订阅

订阅专栏

数学

39 篇文章 0 订阅

订阅专栏

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

题意：给你n个数，找出有多少个子区间含(第k大的数大于等于m) ; 反过来想：就是找，多少个区间里有至少k个大于等于m的数

#include<iostream>
using namespace std;
typedef long long ll;   //int 存不下 
int a[250000];
int main(){
	ios::sync_with_stdio(false);  //不加速会TLE 
	cin.tie(0);
	cout.tie(0);   
	int t;
	cin>>t;
	while(t--){
		int n,m,k;
		cin>>n>>m>>k;
		for(int i=0;i<n;i++){
			cin>>a[i];
		}
		ll ans=0;
		int count=0;        //记录每个小区间的元素个数 
		int r=0;            //左标尺 
		for(int i=0;i<n;i++){
			while(r<n&&count<k){
				if(a[r]>=m) 
				count++;
				r++;
			}
			if(count>=k) 
			ans+=n-1-r+2; //看图 
			if(a[i]>=m) 
			count--;     //标尺右移 
		}
		cout<<ans<<endl; 
	}
	return 0;
}