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.
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.
Print the only integer — the maximum value of f.
5 1 4 2 3 1
3
4 1 5 4 7
6
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就加了个num,终判判掉了,去了就A了,很水的一个题,我想多了,既然f[i]=a[i]-a[i+1],就已经保证l<r了,做题少想些,少点套路,多点真诚。
代码:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#define LL long long
using namespace std;
LL a[300000];
LL b[300000];
LL c[300000];
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%I64d",&a[i]);
}
a[n]=0;
for(int i=0;i<n;i++){
b[i]=abs(a[i]-a[i+1]);
if(i&1)
b[i]=-b[i];
c[i]=-b[i];
}
LL sum=0,mic=0;
for(int i=0;i<n-1;i++){
sum+=b[i];
if(sum<0){
sum=0;
}
mic=max(mic,sum);
}
sum=0;
for(int i=0;i<n-1;i++){
sum+=c[i];
if(sum<0){
sum=0;
}
mic=max(mic,sum);
}
mic=max(sum,mic);
cout<<mic<<endl;
return 0;
}