3206 - Prison Transfer - PK@Contest.bjtu

3206.Prison Transfer

Time Limit: 1s Memory Limit: 256MB

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 Format(From the terminal/stdin)

The first line of input will contain three space separated integers n(1 \le n \le 2 \cdot 105), t(0 \le t \le 109) and c(1 \le c \le n). The next line will contain n space separated integers, the ith integer is the severity ith prisoner's crime. The value of crime severities will be non-negative and will not exceed 109.

Output Format(To the terminal/stdout)

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

Sample Input 1

Copy

4 3 3
2 3 1 1
 · · \n
 · · · \n

Sample Output 1

Copy

2
 \n

Sample Input 2

Copy

1 1 1
2
 · · \n
 \n

Sample Output 2

Copy

0
 \n

Sample Input 3

Copy

11 4 2
2 2 0 7 3 2 2 4 9 1 4
  · · \n
 · · · · · · · · · · \n

Sample Output 3

Copy

6
 \n

Submit

请先登录

Submit

题解(0)