CF855B.Marvolo Gaunt's Ring

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 xx drops of the potion he made.

Value of xx is calculated as maximum of pai+qaj+rakp·a_{i}+q·a_{j}+r·a_{k} for given p,q,rp,q,r and array a1,a2,... ana_{1},a_{2},...\ a_{n} such that 1<=i<=j<=k<=n1<=i<=j<=k<=n . Help Snape find the value of xx . Do note that the value of xx may be negative.

输入格式

First line of input contains 44 integers n,p,q,rn,p,q,r ( 109<=p,q,r<=109,1<=n<=105-10^{9}<=p,q,r<=10^{9},1<=n<=10^{5} ).

Next line of input contains nn space separated integers a1,a2,... ana_{1},a_{2},...\ a_{n} ( 109<=ai<=109-10^{9}<=a_{i}<=10^{9} ).

输出格式

Output a single integer the maximum value of pai+qaj+rakp·a_{i}+q·a_{j}+r·a_{k} that can be obtained provided 1<=i<=j<=k<=n1<=i<=j<=k<=n .

输入输出样例

  • 输入#1

    5 1 2 3
    1 2 3 4 5
    

    输出#1

    30
    
  • 输入#2

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

    输出#2

    12
    

说明/提示

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

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

首页