codeforces contest 855 problem B(前缀后缀)

Marvolo Gaunt's Ring

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present there. He saw Marvolo Gaunt's Ring and identified it as a Horcrux. Although he destroyed it, he is still affected by its curse. Professor Snape is helping Dumbledore remove the curse. For this, he wants to give Dumbledore exactly x drops of the potion he made.

Value of x is calculated as maximum of p·a_i + q·a_j + r·a_k for given p, q, r and array a₁, a₂, ... a_n such that 1 ≤ i ≤ j ≤ k ≤ n. Help Snape find the value of x. Do note that the value of x may be negative.

Input

First line of input contains 4 integers n, p, q, r ( - 10⁹ ≤ p, q, r ≤ 10⁹, 1 ≤ n ≤ 10⁵).

Next line of input contains n space separated integers a₁, a₂, ... a_n ( - 10⁹ ≤ a_i ≤ 10⁹).

Output

Output a single integer the maximum value of p·a_i + q·a_j + r·a_k that can be obtained provided 1 ≤ i ≤ j ≤ k ≤ n.

Examples

Input

5 1 2 3
1 2 3 4 5

Output

30

Input

5 1 2 -3
-1 -2 -3 -4 -5

Output

12

Note

In the first sample case, we can take i = j = k = 5, thus making the answer as 1·5 + 2·5 + 3·5 = 30.

In second sample case, selecting i = j = 1 and k = 5 gives the answer 12.

解：维护一下前后缀

一开始维护了前俩项在前i项的最大值 更新最大值 挂了。。又维护了后两项的最大值 也挂了。。

#include <algorithm>
#include <string.h>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e6+10;
LL dp[N],dp1[N],dp2[N];
LL a[N];


int main()
{
    LL n, p, q, r;
    scanf("%I64d %I64d %I64d %I64d",&n,&p,&q,&r);
    for(LL i=1; i<=n; i++) scanf("%I64d",&a[i]);
    dp1[1]=p*a[1],dp2[n]=r*a[n];
    for(int i=2;i<=n;i++)dp1[i]=max(dp1[i-1],p*a[i]);
    for(int i=n-1;i>=1;i--) dp2[i]=max(dp2[i+1],r*a[i]);
    int flag=-1;
    LL ans;
    for(int i=1;i<=n;i++)
    {
        if(flag==-1||ans<dp1[i]+dp2[i]+q*a[i]) ans=dp1[i]+dp2[i]+q*a[i];
        flag=1;
    }
    cout<<ans<<endl;
    return 0;
}