关闭

Codeforces Round #331 (Div. 2) B. Wilbur and Array

326人阅读 评论(0) 收藏 举报
分类:
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Wilbur the pig is tinkering with arrays again. He has the array a1, a2, ..., an initially consisting of n zeros. At one step, he can choose any index i and either add 1 to all elements ai, ai + 1, ... , an or subtract 1 from all elements ai, ai + 1, ..., an. His goal is to end up with the array b1, b2, ..., bn.

Of course, Wilbur wants to achieve this goal in the minimum number of steps and asks you to compute this value.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the length of the array ai. Initially ai = 0 for every position i, so this array is not given in the input.

The second line of the input contains n integers b1, b2, ..., bn ( - 109 ≤ bi ≤ 109).

Output

Print the minimum number of steps that Wilbur needs to make in order to achieve ai = bi for all i.

Sample test(s)
input
5
1 2 3 4 5
output
5
input
4
1 2 2 1
output
3
Note

In the first sample, Wilbur may successively choose indices 1234, and 5, and add 1 to corresponding suffixes.

In the second sample, Wilbur first chooses indices 1 and 2 and adds 1 to corresponding suffixes, then he chooses index 4 and subtract1.


题意:有n个数a1,a2,a3,a4...an,初始化ai = 0(1<=i<=n)。有两种操作,i到n全部加一,i到n全部减一 (1<=i<=n)。得到b1,b2,b3,b4...bn

两个操作都是对,i到n操作,那肯定是先确定前面的,才能确定后面的。

有了这个思想就可以了。
注意我们敲的代码避免和库函数相同,我就因为写了个abs(int x)就编译错误。

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:36060次
    • 积分:1417
    • 等级:
    • 排名:千里之外
    • 原创:110篇
    • 转载:2篇
    • 译文:0篇
    • 评论:3条
    最新评论