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.

题意：长度为n的序列，求满足公式的最大和。

思路：首先我们需要把相邻的两个数的绝对值算出来。通过观察分析，其实就是求最大子序列和，不过是+ 和 - 是交替的，需要分情况来处理。

代码如下：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
long long a[100010],b[100010];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));//初始化
        memset(b,0,sizeof(b));
        for(int i=1; i<=n; i++)
            scanf("%lld",&a[i]);
        for(int i=1; i<n; i++)  //求相邻两个数差的绝对值
            b[i] =abs(a[i]-a[i+1]);
        long long sum=0,maxx=0;
        int cns=0,k=1;
        for(int i=k; i<n; i++) //求最大子序列和
        {
            if(cns%2==0)  //偶数的话+
            {
                sum+=b[i];
                cns++;
            }
            else   //奇数的话 -
            {
                sum-=b[i];
                cns++;
            }
            if(sum>maxx)  //维护最大值
            {
                maxx=sum;
            }
            if(sum<0)   //重新选定
            {
                sum=0;
                cns=0;
                i=k++;
            }
        }
        printf("%lld\n",maxx);
    }
    return 0;
}