Codeforces Round #481 (Div. 3) E. Bus Video System

E. Bus Video System
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The busses in Berland are equipped with a video surveillance system. The system records information about changes in the number of passengers in a bus after stops.

If xx is the number of passengers in a bus just before the current bus stop and yy is the number of passengers in the bus just after current bus stop, the system records the number yxy−x. So the system records show how number of passengers changed.

The test run was made for single bus and nn bus stops. Thus, the system recorded the sequence of integers a1,a2,,ana1,a2,…,an (exactly one number for each bus stop), where aiai is the record for the bus stop ii. The bus stops are numbered from 11 to nn in chronological order.

Determine the number of possible ways how many people could be in the bus before the first bus stop, if the bus has a capacity equals to ww (that is, at any time in the bus there should be from 00 to ww passengers inclusive).

Input

The first line contains two integers nn and ww (1n1000,1w109)(1≤n≤1000,1≤w≤109) — the number of bus stops and the capacity of the bus.

The second line contains a sequence a1,a2,,ana1,a2,…,an (106ai106)(−106≤ai≤106), where aiai equals to the number, which has been recorded by the video system after the ii-th bus stop.

Output

Print the number of possible ways how many people could be in the bus before the first bus stop, if the bus has a capacity equals to ww. If the situation is contradictory (i.e. for any initial number of passengers there will be a contradiction), print 0.

Examples
input
Copy
3 5
2 1 -3
output
Copy
3
input
Copy
2 4
-1 1
output
Copy
4
input
Copy
4 10
2 4 1 2
output
Copy
2
Note

In the first example initially in the bus could be 0011 or 22 passengers.

In the second example initially in the bus could be 112233 or 44 passengers.

In the third example initially in the bus could be 00 or 11

 passenger

题意:乘公交车,一组数代表每个车站上下车人数.,求第一车下车时车上的人数有多少种可能

题解:遍历求出车上上来的最大人数,和下去的最大人数,判断其正负不同时的情况

代码:

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int n,w;
int maxsum = -(1<<30);
int minsum = 1<<30;
int a[1010];

int main()
{
	scanf("%d %d",&n,&w);
	int sum=0;
	for(int i=0;i<n;i++)
	{
		scanf("%d",a+i);
		sum += a[i];
		maxsum = max(maxsum, sum);
		minsum = min(minsum, sum);	
	}
	if(maxsum>w||minsum<-w)
		printf("0\n");
	else
	{
		if(maxsum<0)
			printf("%d\n",minsum+w+1);
		else if(minsum<0)
		{
			if(w-maxsum-abs(minsum)>=0)
				printf("%d\n",w-maxsum-abs(minsum)+1);
			else
				printf("0\n");
		}
		else
		{
			printf("%d\n",w-maxsum+1);
		}
	}
}

阅读更多
换一批

没有更多推荐了,返回首页