Counter Strike 是怎么实现的

Question

Problem Description
Anti-terrorism is becoming more and more serious nowadays. The country now has n soldiers,and every solider has a score.

We want to choose some soldiers to fulfill an urgent task. The soldiers chosen must be adjacent to each other in order to make sure that they can cooperate well. And all the soldiers chosen must have an average score greater than a.

Now, please calculate how many ways can the chief of staff choose the soldiers.

Input
The first line consists of a single integer t, indicating number of test cases.

For each test case, the first line gives n, the number of soldiers, and a, the minimum possible average score(n<=100000,a<=10000). The second line gives n integers, corresponding to the soldiers' scores in order. All the scores are no greater than 10000.

Output
An integer n, number of ways to choose the soldiers.

Sample Input
2
5 3
1 3 7 2 4
1 1000
9999

Sample Output
10
1

Answer 1

以下回答参考 皆我百晓生、券券喵儿 等免费微信小程序相关内容作答，并由本人整理回复。

#include<bits/stdc++.h>
using namespace std;
int main(){
    int T;cin>>T;
    while(T--){
        int N,A;cin>>N>>A;
        vector<int> nums(N);
        for(int i=0;i<N;++i)cin>>nums[i];
        sort(nums.begin(),nums.end());
        long long ans=0;
        for(int i=0,j=1;i<N-1&&j<N;++i){
            if((long long)(nums[j]-nums[i])*(long long)(nums[N-1]-nums[i])/(N-1)>=(long long)(A*A)){
                ++ans;
            }
            j++;
        }
        cout<<ans<<endl;
    }
}