poj 2796 Feel Good (单调栈)
来源:互联网 发布:哈登 nba数据 编辑:程序博客网 时间:2024/05/29 14:42
Feel Good
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9778 Accepted: 2652Case 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
Source
Northeastern Europe 2005
单调栈:保存一下;
#include <cstdio>#include <cstring>using namespace std;const int maxn=100001;int s[maxn],a[maxn];long long sum[maxn];int main(){ int n; while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) { scanf("%d",&a[i]); sum[i]=sum[i-1]+a[i]; } a[n+1]=-1; long long ans=-1,temp; int top=0,l,r; for(int i=1;i<=n+1;i++) { while(top!=0 && a[s[top]]>a[i]) { temp=a[s[top]]*(sum[i-1]-sum[s[top-1]]); if(ans<temp) { ans=temp; l=s[top-1]+1; r=i-1; } top--; } top++; s[top]=i; } printf("%lld\n%d %d\n",ans,l,r); } return 0;}
#include <cstdio>#include <cstring>using namespace std;const int maxn=100001;struct S{ int num,id;}s[maxn];struct C{ int num,l,r;}c[maxn];int a[maxn];long long sum[maxn];int main(){ int n,top,i,j,l,r; long long ans=-1,temp; while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) { scanf("%d",&a[i]); c[i].num=a[i]; sum[i]=sum[i-1]+a[i]; } s[0].num=-1; s[0].id=0; top=0; for(i=1;i<=n;i++) { for(j=top;j>=0;j--) { if(a[i]>s[j].num) break; else { c[s[j].id].l=i-1; } } s[j+1].num=a[i]; s[j+1].id=i; top=j+1; c[i].r=s[top-1].id+1; } for(j=0;j<=top;j++) c[s[j].id].l=n; for(i=1;i<=n;i++) { temp=(sum[c[i].l]-sum[c[i].r-1])*c[i].num; if(ans<temp) { ans=temp; l=c[i].l; r=c[i].r; } } printf("%lld\n%d %d\n",ans,r,l); } return 0;}
0 0
- 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 2796】 Feel 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 2796 Feel Good(单调栈)
- POJ 2796 Feel Good -- 单调栈,DP
- POJ 2796 Feel Good(单调栈)
- poj 2796 Feel Good 单调栈/dp
- POJ 2796 Feel Good(单调栈)
- SharePoint开发中的最佳实践
- 问题1——在子进程中调用execl完后,接着调用_exit(0)的意义——< APUE-P201>
- KMP算法 算法摘记
- IaaS, PaaS和SaaS公司都做些什么
- 内存_PA_MAP_VA
- poj 2796 Feel Good (单调栈)
- 统一设计,iOS6也玩扁平化
- 使用jdbc向数据库插入100000条记录
- lvs+ldirectord
- 算法之逆序对问题求解
- HDU 2553 N皇后问题
- linux tree 命令
- 十个海量数据处理方法大总结
- python Image库 出错