D - Functions again

题意：

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 f, which is defined as follows:

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

Input

The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.

The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.

Output

Print the only integer — the maximum value of f.

Examples

Input

5
1 4 2 3 1

Output

3

Input

4
1 5 4 7

Output

6

Note

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

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

题意，思路：

由题我们可以看出，是从某一个位置开始让我们求出这一串数字的相邻两项的差值，并且这些数值还是正负交错的，所以我们可以先求出相邻两项的差值，因为开始的位置不同，所以在不同的位置上差值的正负也不同，所以我们可以够找出来两个序列，正负值相反，然后再求出来最大值。

注意，因为数值太大，所以要用长整型数据。

代码如下：

#include<stdio.h>
#include<math.h>
using namespace std;
#define LL long long
#define N 100010

int a[N];
LL b[N];
LL c[N];

int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&a[i]);
    }
    LL x;
    for(int i=1; i<n; i++)
    {
        x=fabs(a[i]-a[i-1]);
        if(i%2)
            b[i]=x;
        else
            b[i]=-x;
        c[i]=-b[i];
    }
    LL s=0,mx=0;
    for(int i=1; i<n; i++)
    {
        if(s+c[i]<0)
            s=0;
        else
            s+=c[i];
        if(s>mx)
            mx=s;
    }
    s=0;
    for(int i=1; i<n; i++)
    {
        if(s+b[i]<0)
            s=0;
        else
            s+=b[i];
        if(s>mx)
            mx=s;
    }
    printf("%lld\n",mx);
    return 0;
}