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.
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}$ ).
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
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$ .
In second sample case, selecting $i=j=1$ and $k=5$ gives the answer $12$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted