题库练习 Marvolo Gaunt's Ring
← 上一题 下一题 →

A11254 | Marvolo Gaunt's Ring

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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_{1},a_{2},...\ 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.

输入格式

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

Next line of input contains $n$ space separated integers $a_{1},a_{2},...\ a_{n}$ ( $-10^{9}<=a_{i}<=10^{9}$ ).

输出格式

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$ .

输入输出样例

输入 #1
5 1 2 3
1 2 3 4 5
输出 #1
30
输入 #2
5 1 2 -3
-1 -2 -3 -4 -5
输出 #2
12
C++ 编辑器
输入
输出