Codeforces Round #407 (Div. 2) C. Functions again（前缀和）

最新推荐文章于 2022-08-21 01:05:54 发布

吃货妍

最新推荐文章于 2022-08-21 01:05:54 发布

阅读量584

点赞数

分类专栏： Codeforces 文章标签： codeforces

本文链接：https://blog.csdn.net/qq_33183401/article/details/68947253

版权

Codeforces 专栏收录该内容

141 篇文章 0 订阅

订阅专栏

C. Functions again
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.
题意：根据上面公式算出最大值。
题解：前缀和，用两个set分别维护以奇数点为结尾的前缀和和以偶数点为结尾的前缀和。对于一个点i，考虑三种情况，
1：以i为结尾的前缀和最大。
2：减去一个以奇数为结尾的前缀和后最大。
3：减去一个以偶数点为结尾的前缀和后最大。
对于2：新形成的是以偶数点开始，需要整体取反，所以减去的是前面的最大值。3则相反。
代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5+7;
ll a[N],dp[N];
set<ll>A,B;
int n;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    if(n==2) {cout<<abs(a[1]-a[2])<<endl;return 0;}
    for(int i=1;i<n;i++)
    {
        ll x=abs(a[i]-a[i+1]);
        if(i&1) dp[i]=dp[i-1]+x;
        else dp[i]=dp[i-1]-x;
    }
    A.insert(dp[1]);
    B.insert(dp[2]);
    ll ans=max(dp[1],dp[2]);
    ans=max(ans,abs(a[2]-a[3]));
    for(int i=3;i<n;i++)
    {
        ans=max(ans,dp[i]);
        ans=max(ans,dp[i]-*B.begin());
        ans=max(ans,-(dp[i]-*--A.end()));
        if(i&1) A.insert(dp[i]);
        else B.insert(dp[i]);
    }
    cout<<ans<<endl;
}