codeforces 427B
来源:互联网 发布:成都工业学院软件 编辑:程序博客网 时间:2024/04/29 17:35
http://codeforces.com/problemset/problem/427/B
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.
The first line of input will contain three space separated integers n (1 ≤ n ≤ 2·105), t (0 ≤ t ≤ 109) andc (1 ≤ c ≤ n). The next line will contain n space separated integers, the ith integer is the severity ithprisoner's crime. The value of crime severities will be non-negative and will not exceed 109.
Print a single integer — the number of ways you can choose the c prisoners.
4 3 32 3 1 1
2
1 1 12
0
11 4 22 2 0 7 3 2 2 4 9 1 4
6
#include <stdio.h>#include <string.h>#include <iostream>using namespace std;int main(){ int n,c,t,x; while(~scanf("%d%d%d",&n,&t,&c)) { int sum=0; int count=0; int flag=1; for(int i=0;i<n;i++) { scanf("%d",&x); if(x<=t) sum++; else { flag=0; if(sum>=c) count+=sum-c+1; sum=0; } //printf("(%d,%d,%d)\n",i,sum,count); } if(flag&&sum>=c) { count+=sum-c+1; } else if(sum>=c) { count+=sum-c+1; } printf("%d\n",count); } return 0;}
- codeforces 427B
- codeforces 427B
- CodeForces 427B
- Codeforces 427B Prison Transfer
- [Codeforces] 427B - Prison Transfer
- CodeForces 427B Prison Transfer
- CodeForces - 427B (模拟题)
- CodeForces 427B Prison Transfer
- CodeForces - 427B Prison Transfer
- codeforces B
- codeforces B
- codeforces B
- codeforces B
- Codeforces Round #427 (Div. 2) B
- Codeforces Round #427 (Div. 2)(A+B)
- Codeforces Round #427 (Div.2) B
- CodeForces 626B CodeForces 626B【暴力】
- CodeForces 841B (B) 博弈
- 高手速成android开源项目【项目篇】
- OCP 1Z0 051 10
- 高手速成android开源项目【developer篇】
- 高手速成android开源项目【blog篇】
- 特征选择(二)-聚类变换
- codeforces 427B
- 求二进制数中高位或低位第一次出现1所在的位置
- 第十一周
- struts2传递json数据给ajax解析
- TCP UDP 经典 4个小例子 实现代码
- C++ Primer Plus巩固 新特性 新理解(2)
- 关于fork()函数的两个返回值
- php(CI框架)+ajax实现类似微博的东东
- Semaphore信号量