标签：
| Time Limit: 1000MS | Memory Limit: 262144KB | 64bit IO Format: %I64d & %I64u |
Description
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,
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.
Sample Input
4 3 3
2 3 1 1
2
1 1 1
2
0
11 4 2
2 2 0 7 3 2 2 4 9 1 4
6
Source
#include <iostream> #include <algorithm> #include <string.h> #include <stdlib.h> #include <math.h> #include <stdio.h> using namespace std; int a[200050]; int main() { int i,j,n,t,c,flag=0,ans=0; scanf("%d%d%d",&n,&t,&c); for(i=0;i<n;i++) cin>>a[i]; for(i=0;i<n;i++) { if (a[i]>t) { if(flag>=c) ans=ans+flag-c+1; flag=0; } else if(a[i]<=t) flag=flag+1; } if(flag>=c) ans=ans+flag-c+1; printf("%d\n",ans); return 0; }
标签：
原文地址：http://www.cnblogs.com/Ritchie/p/5425275.html
