Manthan, Codefest 17: B. Marvolo Gaunt's Ring
来源:互联网 发布:linux下安装jenkins 编辑:程序博客网 时间:2024/05/16 16:17
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·ai + q·aj + r·ak for given p, q, r and array a1, a2, ... an 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 ( - 109 ≤ p, q, r ≤ 109, 1 ≤ n ≤ 105).
Next line of input contains n space separated integers a1, a2, ... an ( - 109 ≤ ai ≤ 109).
Output a single integer the maximum value of p·ai + q·aj + r·ak that can be obtained provided 1 ≤ i ≤ j ≤ k ≤ n.
5 1 2 31 2 3 4 5
30
5 1 2 -3-1 -2 -3 -4 -5
12
题意:
给出三个数p, q, r,再给出n个数(a[1], a[1], … , a[n]),求p*a[i]+q*a[j]+r*a[k]的最大值,要求i<=j<=k
求出p*a[i]的前缀最大值b[i],再求出r*a[k]的后缀最大值c[i]
最后答案就是max(b[i]+c[i]+q*a[i]) (1<=i<=n)
注意ans初始值一定要小于-1e18
#include<stdio.h>#include<algorithm>using namespace std;#define LL long longLL a[100005], b[100005], c[100005];int main(void){LL n, i, p, q, r, ans;scanf("%I64d%I64d%I64d%I64d", &n, &p, &q, &r);for(i=1;i<=n;i++)scanf("%I64d", &a[i]);for(i=1;i<=n;i++)b[i] = p*a[i];for(i=2;i<=n;i++)b[i] = max(b[i], b[i-1]);for(i=n;i>=1;i--)c[i] = r*a[i];for(i=n-1;i>=1;i--)c[i] = max(c[i], c[i+1]);ans = -(LL)1e18*4;for(i=1;i<=n;i++)ans = max(q*a[i]+b[i]+c[i], ans);printf("%I64d\n", ans);return 0;}/*3 1000000000 1000000000 1000000000-1000000000 -1000000000 -1000000000*/
- Manthan, Codefest 17 Marvolo Gaunt's Ring
- Manthan, Codefest 17: B. Marvolo Gaunt's Ring
- codeforces Manthan, Codefest 17 B Marvolo Gaunt's Ring(dp)
- codeforces Manthan, Codefest 17 B.Marvolo Gaunt's Ring (简单dp)
- Manthan, Codefest 17 B. Marvolo Gaunt's Ring(前后缀/dp)
- Codeforces 855 B Marvolo Gaunt's Ring
- CF 855B. Marvolo Gaunt's Ring【枚举||递推】
- Codeforces 855 B Marvolo Gaunt's Ring(dp)
- Manthan, Codefest 17 B
- Manthan, Codefest 17 B-F题目详解
- Manthan, Codefest 17
- Manthan, Codefest 17
- Manthan, Codefest 17 C. Helga Hufflepuff's Cup
- cf Manthan, Codefest 17 E. Salazar Slytherin's Locket
- Manthan, Codefest 17 E. Salazar Slytherin's Locket 数位DP
- Manthan, Codefest 17 C. Helga Hufflepuff's Cup
- Manthan, Codefest 16 -B. A Trivial Problem
- Manthan, Codefest 17 E. Salazar Slytherin's Locket(数位DP)
- android常用系统bar高度
- 不明恶意攻击致<搜狗搜索><搜索结果>跳转<百度搜索>技术原理分析
- linux比较两个二进制文件(vim)
- 修改wordpress后台登陆页面,防止暴力破解
- SQL性能优化
- Manthan, Codefest 17: B. Marvolo Gaunt's Ring
- Centos7 mailx发送邮件
- [随笔] GuavaCache简介
- 《C++ Concurrency in Action》笔记18 std::shared_future
- matlab曲线拟合工具箱cftool
- Java虚拟机工作原理详解
- 带你了解唐山市路北区景泰翰林(翰林雅居、卫国路、学院路、长宁道)
- Qt实现TcpClient和TcpServer连接收发数据
- TP5 ajax提交表单