Police Recruits


一、Police Recruits

本题链接Police Recruits

题目
A. Police Recruits
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 ≤ 1e5), 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.

Examples
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.

本博客给出本题截图
在这里插入图片描述
在这里插入图片描述

题意:输入-1证明产生了一个犯罪,输入其他正整数(小于10)代表招募警察的数量,每个警察在处理完一个犯罪后就会退休,且初始警察数为0,问有多少起犯罪是没有警察出来的

AC代码

#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    
    int res = 0, cnt = 0;
    for (int i = 0; i < n; i ++ )
    {
        int a;
        cin >> a;
        if (a == -1) 
        {
            if (cnt == 0) res ++;
            else cnt --;
        }
        else cnt += a;
    } 
    
    cout << res << endl;
    
    return 0;
}

总结

水题,不解释

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

辰chen

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值