Codeforces Round #407 C

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#define ll long long
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a) memset(a,0,sizeof(a))
using namespace std;
const int N=1e5+100;
int a[N],b[N],c[N];
int main(){
    int n;
    cin>>n;
    for(int i=1; i<=n; ++i){
        scanf("%d",a+i);
    }
    for(int i=1; i<n; ++i){
        b[i]=abs(a[i]-a[i+1]);
        c[i]=b[i];
        if(i&1) b[i]*=-1;
        else c[i]*=-1;
    } //for(int i=1; i<n; ++i) cout<<b[i]<<" ";cout<<"\n";for(int i=1; i<n; ++i) cout<<c[i]<<" ";cout<<"\n";
    ll tmp=0,ans=0;
    for(int i=2; i<n; ++i){
        tmp+=b[i];
        ans=max(tmp,ans);
        if(tmp<0){
            tmp=0;
        }
    }
    tmp=0;
    for(int i=1; i<n; ++i){
        tmp+=c[i];
        ans=max(tmp,ans);
        if(tmp<0){
            tmp=0;
        }
    }
    cout<<ans<<endl;
    return 0;
}