CF788A.Functions again

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function ff , which is defined as follows:

In the above formula, 1<=l<r<=n must hold, where nn is the size of the Main Uzhlyandian Array aa , and x|x| means absolute value of xx . But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of ff among all possible values of ll and rr for the given array aa .

输入格式

The first line contains single integer nn ( 2<=n<=1052<=n<=10^{5} ) — the size of the array aa .

The second line contains nn integers a1,a2,...,ana_{1},a_{2},...,a_{n} (- 109<=ai<=10910^{9}<=a_{i}<=10^{9} ) — the array elements.

输出格式

Print the only integer — the maximum value of ff .

输入输出样例

  • 输入#1

    5
    1 4 2 3 1
    

    输出#1

    3
  • 输入#2

    4
    1 5 4 7
    

    输出#2

    6

说明/提示

In the first sample case, the optimal value of ff is reached on intervals [1,2][1,2] and [2,5][2,5] .

In the second case maximal value of ff is reachable only on the whole array.

首页