poj_Feel Good_单调栈
来源:互联网 发布:最终幻想15剧情 知乎 编辑:程序博客网 时间:2024/06/07 19:41
Feel Good
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 10711 Accepted: 2932Case Time Limit: 1000MS Special Judge
Description
Bill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studying how good or bad days influent people's memories about some period of life.
A new idea Bill has recently developed assigns a non-negative integer value to each day of human life.
Bill calls this value the emotional value of the day. The greater the emotional value is, the better the daywas. Bill suggests that the value of some period of human life is proportional to the sum of the emotional values of the days in the given period, multiplied by the smallest emotional value of the day in it. This schema reflects that good on average period can be greatly spoiled by one very bad day.
Now Bill is planning to investigate his own life and find the period of his life that had the greatest value. Help him to do so.
A new idea Bill has recently developed assigns a non-negative integer value to each day of human life.
Bill calls this value the emotional value of the day. The greater the emotional value is, the better the daywas. Bill suggests that the value of some period of human life is proportional to the sum of the emotional values of the days in the given period, multiplied by the smallest emotional value of the day in it. This schema reflects that good on average period can be greatly spoiled by one very bad day.
Now Bill is planning to investigate his own life and find the period of his life that had the greatest value. Help him to do so.
Input
The first line of the input contains n - the number of days of Bill's life he is planning to investigate(1 <= n <= 100 000). The rest of the file contains n integer numbers a1, a2, ... an ranging from 0 to 106 - the emotional values of the days. Numbers are separated by spaces and/or line breaks.
Output
Print the greatest value of some period of Bill's life in the first line. And on the second line print two numbers l and r such that the period from l-th to r-th day of Bill's life(inclusive) has the greatest possible value. If there are multiple periods with the greatest possible value,then print any one of them.
Sample Input
63 1 6 4 5 2
Sample Output
603 5
#include <iostream>#include <stdio.h>#include <string.h>#define N 100010using namespace std;int a[N];int lef[N], rig[N];long long sum[N];int n;int main(){ while (scanf("%d", &n) != EOF) { memset(lef, 0, sizeof(lef)); memset(rig, 0, sizeof(rig)); memset(sum, 0, sizeof(sum)); int i; for(i = 1; i <= n; i++) { scanf("%d", &a[i]); sum[i] = sum[i - 1] + a[i]; lef[i] = rig[i] = i; } for (i = 2; i <= n; i++) { while (lef[i] > 1 && a[lef[i] - 1] >= a[i]) lef[i] = lef[lef[i] - 1]; } for (i = n - 1; i >= 1; i--) { while (rig[i] < n && a[rig[i] + 1] >= a[i]) rig[i] = rig[rig[i] + 1]; } int resl, resr; long long res = -1; for (i = 1; i <= n; i++) { long long temp = a[i] * (sum[rig[i]] - sum[lef[i] - 1]); if (res < temp) { resl = lef[i]; resr = rig[i]; res = temp; } } printf("%lld\n%d %d\n", res, resl, resr); } return 0;}
0 0
- poj_Feel Good_单调栈
- 单调栈 单调队列
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- 单调栈
- macvim 配置
- 第三题
- leetcode--Search in Rotated Sorted Array
- java中常用的工具类
- 事件驱动机制在单片机软件中的应用
- poj_Feel Good_单调栈
- Nginx系列(十一.nginx正向代理)
- 【Java-IO】Java文件操作
- Python判断当前操作系统类型以及os/sys/platform模块简介
- Selenium RC工作原理和测试案例
- 内存重叠之strcpy&memmove
- BZOJ 3307 雨天的尾巴 线段树
- 利用SecureCRT上传、下载文件(使用sz与rz命令)
- pom.xml中build标签