Codeforces 789C A. Functions again

最新推荐文章于 2018-08-19 21:40:06 发布

Low丶Coder

最新推荐文章于 2018-08-19 21:40:06 发布

阅读量377

点赞数

分类专栏： DP

本文链接：https://blog.csdn.net/sinat_37158899/article/details/77822948

版权

DP 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

A. 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:

$\text{[math]}$

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

input

4
1 5 4 7

output

暑期训练第一场H，貌似没人做这题当时。

题意就是给你一个式子，让你选取一个起始位置，从起始位置到末位置的和，使得这个和最大。

仔细分析（其实就是看题解）

如果没有后面（-1）的n次方，就是开一个数组存后一项与前一项的差，再求最大连续子序列和。

有了-1的n次以后，可以分类讨论、

分为以奇数起始和偶数起始两类；

如果以奇数起始，则偶数项为原来的相反数。

处理以后求一个maxsum；

反之，以偶数起始，则奇数项为原来的相反数。

处理一次再求一个maxsum；

两者的较大值即为答案。（这个也算dp的一种？）

#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#define N 100100
typedef long long ll;
ll a[N],b[N];
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
        scanf("%I64d",&a[i]);
    for(int i=1; i<n; i++)
        b[i]=abs(a[i]-a[i+1]);
    ll ans[N]= {0},q=0;
    for(int i=1; i<n; i++)
        if(i%2)
            b[i]=-b[i];//处理以偶数下标起头的
    ll maxsum,maxhere;
    maxsum=maxhere=b[1];
    for(int i=2; i<n; i++)
    {
        if(maxhere<=0)
            maxhere=b[i];
        else maxhere+=b[i];
        maxsum=max(maxsum,maxhere);
    }
    q=maxsum;
    for(int i=1; i<n; i++)
        b[i]=-b[i];//处理以奇数下标起头的
    maxsum=maxhere=b[1];
    for(int i=2; i<n; i++)
    {
        if(maxhere<=0)//如果现有的和为负的
            maxhere=b[i];//则当前最大和为元素本身
        else maxhere+=b[i];
        maxsum=max(maxsum,maxhere);
    }
    q=max(q,maxsum);
    printf("%I64d\n",q);
    return 0;

}

cf上最短的代码。。看了以后跪了。。但是看不懂。。先贴上来。。

#include <bits/stdc++.h>
using namespace std;

long long n,a1,a2,b,c,d,t,y;

int main()
{
	cin>>n>>a1;
	while (--n)
	{
		cin>>a2; b=abs(a1-a2); a1=a2;
		t=c; c=max(b,d+b); y=max(y,c); d=t-b;
	}
	cout<<y;
}