C. Functions again

C. Functions again

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

仔细想一想，对于一个l r 区间的最大值，其实就是求一个最大连续子序列。

不过这个地方有点特殊，区间都是以开头为正数的。然后正负正负。

但仔细想想就会发现其实就只有两种情况：

对于这整个差的绝对值得序列：

1.正负正负.......

2.负正负正......

所以我们构造这样的两个序列，求这两个序列的最大子序列。

#include <bits/stdc++.h>

using namespace std;
const int MAXN=1e5+7;
int n;
int num[MAXN];
int ans1[MAXN];
int ans2[MAXN];
int main()
{
   scanf("%d",&n);
   for(int i=0;i<n;++i)
   {
       scanf("%d",&num[i]);
       if(i)
       {
           int t=abs(num[i]-num[i-1]);
           if(i%2)
           {
               ans1[i]=t;
               ans2[i]=-t;
           }
           else
           {
               ans1[i]=-t;
               ans2[i]=t;
           }
       }
   }
   long long MAX=0;
   long long sum=0;
   for(int i=1;i<n;++i)
   {
       if(sum+ans1[i]>0)
       {
           sum+=ans1[i];
       }
       else sum=0;
       MAX=max(MAX,sum);
   }
   sum=0;
   for(int i=1;i<n;++i)
   {
       if(sum+ans2[i]>0)
       {
           sum+=ans2[i];
       }
       else sum=0;
       MAX=max(MAX,sum);
   }
   printf("%I64d\n",MAX);
    return 0;
}