CodeForces 427B Prison Transfer

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#codeforces

Codeforces 专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一道关于从城市监狱中选择一定数量犯罪级别不超过特定值的连续囚犯进行转移的问题，并提供了一个简单的C语言解决方案。

B. Prison Transfer

time limit per test ：1 second

memory limit per test：256 megabytes

input：standard input

output：standard output

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·105), t (0 ≤ t ≤ 109) and c (1 ≤ c ≤ 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

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

题目中的C理解起来有点吃力。这题的意思就是输入n，t , c
n 表示有n个数
t 表示要选的数不能大于t，相当于范围限制
c 表示这个要选出连续的c 个不大于t 的数
输出有多少种可能性

一开始看错题目，居然把所有数从小到大排列了。。其实这题不要排列，就按输入顺序进行检验

ac

ac代码非常简单

#include <stdio.h>

int main()
{
    int n,t,c;
    scanf("%d%d%d",&n,&t,&c);
    int i;int x;int sum=0;int cnt=0;
    for(i=0;i<n;i++)
    {
        scanf("%d",&x);
        if(x>t)
            cnt=0;
        else
            cnt++;
        if(cnt>=c) 
            sum++;//这里考虑只要连续小于t的个数超过要选择的c，则多一个数，多一种选择方式
    }
    printf("%d",sum);
}