题库练习 Kindergarten
← 上一题 下一题 →

A9755 | Kindergarten

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

In a kindergarten, the children are being divided into groups. The teacher put the children in a line and associated each child with his or her integer charisma value. Each child should go to exactly one group. Each group should be a nonempty segment of consecutive children of a line. A group's sociability is the maximum difference of charisma of two children in the group (in particular, if the group consists of one child, its sociability equals a zero).

The teacher wants to divide the children into some number of groups in such way that the total sociability of the groups is maximum. Help him find this value.

输入格式

The first line contains integer $n$ — the number of children in the line ($1\le n\le 10^6$).

The second line contains $n$ integers $a_i$ — the charisma of the $i$-th child ($-10^9\le a_i\le 10^9$).

输出格式

Print the maximum possible total sociability of all groups.

输入输出样例

输入 #1
5
1 2 3 1 2
输出 #1
3
输入 #2
3
3 3 3
输出 #2
0
C++ 编辑器
输入
输出