Functions again CodeForces - 789C

问题：

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.

题意：

求以题上所给公式计算出的最大连续字段和。

思路：

i-l分为两种，i-l为偶数是我们需要| a[i]-a[i+1] |，i-l为奇数时需要 -| a[i]-a[i+1] |我们可以用两个数组分别保留这lian两种情况，然后然后计算出两种情况下的最大连续子序列输出最大的。

代码：

#define N 100100
#include<math.h>
#include<stdio.h>
#include<algorithm>
using namespace std;
long long int a[N],b[N],c[N];//b,c两数组分别保留两相邻差取正和取负
int n;
int main()
{
    while(~scanf("%d",&n))
    {
        for(int i=0; i<n; i++)
        {
            scanf("%lld",&a[i]);
        }
        for(int i=1; i<n; i++)
        {
            long long int x=fabs(a[i]-a[i-1]);
            if(i%2) b[i]=x;//两相邻数的差要么取正，要么取负 //b[i]取正b[i+1]就要去负
            else b[i]=-x;
            c[i]=-b[i];
        }
        long long int d=0,ma=0;
        for(int i=1; i<n; i++)//计算最大子段和
        {
            if(d+c[i]<0)
                d=0;
            else
                d+=c[i];
            if(d>ma)
                ma=d;
        }
        d=0;
        for(int i=1; i<n; i++)//计算另一个最大子段和
        {
            if(d+b[i]<0)
                d=0;
            else
                d+=b[i];
            if(d>ma)  ma=d;

        }
        printf("%lld\n",ma);
    }
    return 0;
}