DP--4.2 R

R
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.
题意：
差不多就是求最大子序列。
然后就要找两组，一组是-1*dp[i][j],另一组是dp[i][j]*1然后dp
跟dp有关的数都用LL

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
#define INF 0x3f3f3f3f
#define E 1e-12
#define N 1000001
#define LL long long
#define MOD 10000
using namespace std;
int a[110000];
LL dp[110000][2];
int main()
{
    int n;
    while(cin>>n)
    {
        int i,j;
        for(i=1;i<=n;i++)
            cin>>a[i];
        dp[1][0]=abs(a[1]-a[2]);
        dp[1][1]=-1*abs(a[1]-a[2]);
        LL l=dp[1][1];
        LL r=dp[1][0];
        LL ans=dp[1][0];
        for(i=2;i<n;i++)
        {
            dp[i][0]=abs(a[i]-a[i+1]);
            dp[i][1]=r-abs(a[i]-a[i+1]);
            dp[i][0]=max(dp[i][0],dp[i][0]+l);
            r=dp[i][0];
            l=dp[i][1];
            ans=max(dp[i][0],ans);
            ans=max(dp[i][1],ans);
        }
        cout<<ans<<endl;
    }
}