CodeForces 427B Prison Transfer

最新推荐文章于 2022-07-22 13:33:59 发布

原创最新推荐文章于 2022-07-22 13:33:59 发布 · 388 阅读

0 ·

CC 4.0 BY-SA版权

AC路漫漫专栏收录该内容

180 篇文章

订阅专栏

本文介绍了一个关于选择连续段罪犯进行转移的问题，并提供了一个算法解决方案。该问题关注于如何在限制条件下选择特定数量的罪犯，确保他们的犯罪级别不超过给定阈值。

The prison of your city has n prisoners. As the prison can't accommodate all of them, the city mayor has decided to transfer c of the prisoners to a prison located in another city.

For this reason, he made the n prisoners to stand in a line, with a number written on their chests. The number is the severity of the crime he/she has committed. The greater the number, the more severe his/her crime was.

Then, the mayor told you to choose the c prisoners, who will be transferred to the other prison. He also imposed two conditions. They are,

The chosen c prisoners has to form a contiguous segment of prisoners.
Any of the chosen prisoner's crime level should not be greater then t. Because, that will make the prisoner a severe criminal and the mayor doesn't want to take the risk of his running away during the transfer.

Find the number of ways you can choose the c prisoners.

Input

The first line of input will contain three space separated integers n (1 ≤ n ≤ 2·10⁵), t (0 ≤ t ≤ 10⁹) and c (1 ≤ c ≤ n). The next line will contain n space separated integers, the i^th integer is the severity i^th prisoner's crime. The value of crime severities will be non-negative and will not exceed 10⁹.

Output

Print a single integer — the number of ways you can choose the c prisoners.

Examples

Input

4 3 3
2 3 1 1

Output

Input

1 1 1
2

Output

Input

11 4 2
2 2 0 7 3 2 2 4 9 1 4

Output

6
#include<iostream>

using namespace std;


int main(){
    long long n,t,c,i,temp,k,sum;
    while(cin>>n>>t>>c){
        k=sum=0;
        for(int i=0;i<n;i++){
            cin>>temp;
            if(temp<=t){
                k++;
            }
            else{
                k=0;
            }
            if(k>=c){
                sum++;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}