POJ 2796 Feel Good
来源:互联网 发布:linux批量解压缩zip 编辑:程序博客网 时间:2024/06/08 17:38
Feel Good
翻译原文
提交地址
单调栈
我觉得就是单调队列。。。
然后每一次都入栈,然后单调递增,
出栈时才有出栈元素当做最小的来计算一次~
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.
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
6
3 1 6 4 5 2
Sample Output
60
3 5
#include<cmath>#include<cstdio>#include<cstring>#include<cstdlib>#include<iostream>#include<algorithm>using namespace std;struct node{ long long x,t;}sta[110000];long long n,a[110000],s[110000],top,ans,x,y;int main(){ scanf("%lld",&n); s[0]=0; for(int i=1;i<=n;i++){ scanf("%lld",&a[i]); s[i]=s[i-1]+a[i]; } a[++n]=-1;top=ans=0; x=1,y=1;sta[0].x=-1;sta[0].t=0; for(int i=1;i<=n;i++){ node ss;ss.x=a[i];ss.t=i; while (ss.x<sta[top].x&&top>0){ long long tmp=(s[ss.t-1]-s[sta[top-1].t])*sta[top].x; if(tmp>ans){ ans=tmp; x=sta[top-1].t+1; y=ss.t-1; } top--; } sta[++top]=ss; } printf("%lld\n%lld %lld\n",ans,x,y);}
- poj 2796 Feel Good
- POJ 2796 Feel Good
- POJ 2796 Feel Good
- poj 2796 Feel Good
- poj 2796 feel good
- POJ-2796-Feel Good
- POJ 2796Feel Good
- poj 2796 Feel Good
- POJ 2796 Feel Good
- poj 2796 Feel Good
- Poj-2796 Feel Good
- POJ 2796 Feel Good
- poj 2796 Feel Good
- poj 2796Feel Good
- POJ 2796 Feel Good
- POJ 2796 Feel Good
- poj 2796 Feel Good
- POJ 2796 Feel Good
- Android Stduio 下NDK 开发规则
- 输入一行字符,输出最长的单词
- 谈谈计划
- ]一周热文推荐:致应届毕业生——程序员的生存法则
- 坐姿也能影响工作效率?
- POJ 2796 Feel Good
- linux开机流程详解
- Microsoft Visual Studio正忙解决办法
- docker常用操作
- 基于Linux(中标麒麟)上QT的环境搭建——解决cannot find lGL的问题
- Mac端口转发
- Android基础之Path类的使用
- javap 命令
- swift中的运算符