CF484D.Kindergarten

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 nn — the number of children in the line (1n1061\le n\le 10^6).

The second line contains nn integers aia_i — the charisma of the ii-th child (109ai109-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
    

说明/提示

In the first test sample one of the possible variants of an division is following: the first three children form a group with sociability 2, and the two remaining children form a group with sociability 1.

In the second test sample any division leads to the same result, the sociability will be equal to 0 in each group.

首页