Codeforces Round #244 (Div. 2)——A. Police Recruits(水)

A. Police Recruits(水)

The police department of your city has just started its journey. Initially, they don’t have any manpower. So, they started hiring new recruits in groups.

Meanwhile, crimes keeps occurring within the city. One member of the police force can investigate only one crime during his/her lifetime.

If there is no police officer free (isn't busy with crime) during the occurrence of a crime, it will go untreated.

Given the chronological order of crime occurrences and recruit hirings, find the number of crimes which will go untreated.

Input

The first line of input will contain an integer n (1 ≤ n ≤ 105), the number of events. The next line will contain n space-separated integers.

If the integer is -1 then it means a crime has occurred. Otherwise, the integer will be positive, the number of officers recruited together at that time. No more than 10 officers will be recruited at a time.

Output

Print a single integer, the number of crimes which will go untreated.

Sample test(s)

input

3
-1 -1 1

output

2

input

8
1 -1 1 -1 -1 1 1 1

output

1

input

11
-1 -1 2 -1 -1 -1 -1 -1 -1 -1 -1

output

8

Note

Lets consider the second example:

1. Firstly one person is hired.
2. Then crime appears, the last hired person will investigate this crime.
3. One more person is hired.
4. One more crime appears, the last hired person will investigate this crime.
5. Crime appears. There is no free policeman at the time, so this crime will go untreated.
6. One more person is hired.
7. One more person is hired.
8. One more person is hired.

The answer is one, as one crime (on step 5) will go untreated.

#include<iostream>
#include <cstring>
using namespace std;
int main()
{
    int n;
    while(cin>>n)
    {
        int  count=0,flag=0;
        for(int i=0;i<n;i++)
        {
            int a;
            cin>>a;
            if(a>0)
            count+=a;
            else
            {
                if(count>0)
                {
                   count--;
                }
                else
                flag++;
            }
        }
        cout<<flag<<endl;
    }
    return 0;
}

B. Prison Transfer

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.

Sample test(s)

input

4 3 3
2 3 1 1

output

2

input

1 1 1
2

output

0

input

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

output

6

#include <iostream>
#include <cstring>
using namespace std;
int main()
{
    int n,t,c;
    while(cin>>n>>t>>c)
    {
        int num=0,a;
        int ans=0;
        for(int i=0;i<n;i++)
        {
            cin>>a;
            if(a>t)
            {
                if(ans>c-1)
                num+=ans-c+1;
                ans=0;
            }
            else
            ans++;
        }
        if(ans>c-1)
        num+=ans-c+1;
        cout<<num<<endl;
    }
    return 0;
}