|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
Byteasar has decided to build a house. He has chosen a very narrow valley as its location. Before Byteasar starts the actual construction work, he has to level the ground first. He has two excavators at his disposal: the first one can either increase or decrease the ground level of any connected area in the valley by exactly a meters; the other can do the same, i.e., either increase or decrease the ground level of any connected area in the valley, but by exactly b meters. Notice that neither before such an operation nor after it needs the ground in the affected area be actually leveled.
Given a map of the area, determine the minimum number of operations required to level the ground in the whole valley, i.e., to make the ground level everywhere equal 0. While the operations are performed, the ground level at any point in the valley can have arbitrary value; in particular, it may be negative.
In the first line of the standard input there are three integers, n, a, b (1 ≤ n ≤ 100,000, 1 ≤ a,b ≤ 109), separated by single spaces. The number n denotes the valley's length in meters. The second line contains n integers, h1,h2,…,hn, separated by single spaces. These numbers, all with absolute value no larger than 109, represent the initial ground level in meters of successive one meter long slices of the valley.
In tests worth 30% of the points the following conditions hold in addition: n,a,b ≤ 200 and -200 ≤ h1,…,hn ≤ 200.
In tests worth 60% of the points the following conditions hold in addition: n,a,b ≤ 2,000 and -2,000 ≤ h1,…,hn ≤ 2,000.
In tests worth 90% of the points the condition a,b ≤ 106 holds in addition.
In the first and only line of the standard output your program should print a single integer: the minimum number of operations required to level the ground in the whole valley, or -1 if leveling the whole valley with given excavators is impossible.
5 2 3 1 2 1 1 -1
One possible solution for the exemplary input is: