AtCoder Regular Contest 119 C
Posted Bcoi
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了AtCoder Regular Contest 119 C相关的知识,希望对你有一定的参考价值。
Problem Statement
There are buildings along the AtCoder Street, numbered through from west to east. Initially, Buildings have the heights of , respectively.
Takahashi, the president of ARC Wrecker, Inc., plans to choose integers and and make the heights of Buildings all zero. To do so, he can use the following two kinds of operations any number of times in any order:
- Set an integer and increase the heights of Buildings and by each.
- Set an integer and decrease the heights of Buildings and by each. This operation can only be done when both of those buildings have heights of or greater.
Note that the range of depends on .
How many choices of are there where Takahashi can realize his plan?
Constraints
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
Output
Print the answer.
Sample Input 1 Copy
5 5 8 8 6 6
Sample Output 1 Copy
3
Takahashi can realize his plan for .
For example, for , the following sequence of operations make the heights of Buildings all zero.
- Decrease the heights of Buildings and by each, six times in a row.
- Decrease the heights of Buildings and by each, eight times in a row.
For the remaining seven choices of , there is no sequence of operations that can realize his plan.
Sample Input 2 Copy
7 12 8 11 3 3 13 2
Sample Output 2 Copy
3
Takahashi can realize his plan for .
For example, for html 以上是关于AtCoder Regular Contest 119 C的主要内容,如果未能解决你的问题,请参考以下文章