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 $x$ is the number of passengers in a bus just before the current bus stop and $y$ is the number of passengers in the bus just after current bus stop, the system records the number $y-x$. So the system records show how number of passengers changed.

The test run was made for single bus and $n$ bus stops. Thus, the system recorded the sequence of integers $a_1,a_2,\dots ,a_n$ (exactly one number for each bus stop), where $a_i$ is the record for the bus stop $i$. The bus stops are numbered from $1$ to $n$ 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 $w$ (that is, at any time in the bus there should be from $0$ to $w$ passengers inclusive).

Input

The first line contains two integers $n$ and $w$ $(1\le n\le 1000,1\le w\le {10}^9)$ — the number of bus stops and the capacity of the bus.

The second line contains a sequence $a_1,a_2,\dots ,a_n$ $(-{10}^6\le a_i\le {10}^6)$, where $a_i$ equals to the number, which has been recorded by the video system after the $i$-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 $w$. 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 $0$, $1$ or $2$ passengers.

In the second example initially in the bus could be $1$, $2$, $3$ or $4$ passengers.

In the third example initially in the bus could be $0$ or $1$

 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);
		}
	}
}