Codeforces Round #407 Functions again（dp,贪心）

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.

    公式中第一项肯定是正数，所以可以从后往前考虑。令f[i]表示最L为i的时候的最大值(不小于0)，令g[i]表示L为i时候的最小值(不超过0，因为可以不选)。转移方程为

f[i-1]=max(-g[i],0)+abs(a[i]-a[i-1]);g[i-1]=min(-f[i],0)+abs(a[i]-a[i-1]);

#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<string.h>
#include<string>
#include<map>
#include<queue>
using namespace std;
long long a[100005];
long long f[100005];
long long g[100005];
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		for(int i=0;i<n;i++)
		{
			scanf("%lld",&a[i]);
		}
		f[n-1]=g[n-1]=0;
		long long ans=0;
		for(int i=n-1;i>=1;i--)
		{
			f[i-1]=max(-g[i],0ll)+abs(a[i]-a[i-1]);
			g[i-1]=min(-f[i],0ll)+abs(a[i]-a[i-1]);
			ans=max(ans,f[i-1]);
		}
		cout<<ans<<endl;
	}
}