poj 2796
来源:互联网 发布:小学语文朗读软件 编辑:程序博客网 时间:2024/06/05 07:27
Feel Good
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 7547 Accepted: 2039Case 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
/*解法同hdu 1506,不同的只是这里要求区间和*/#include <stdio.h>#define N 100001int lef[N],rig[N];__int64 sum[N],a[N];int main(){ int i,j,n; scanf("%d",&n); for(i = 1; i <= n; ++i) { scanf("%I64d",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; --i) while(rig[i] < n && a[rig[i]+1] >= a[i]) rig[i] = rig[rig[i] + 1]; int ll ,rr ; ///答案可以为0,res初始为-1 __int64 res = -1,tmp; for(i = 1; i <= n; ++i) { tmp = a[i] * (sum[rig[i]] - sum[lef[i]-1]); if(tmp > res) { res = tmp; ll = lef[i]; rr = rig[i]; } } printf("%I64d\n%d %d\n",res,ll,rr); // while(1); return 0;}
- POJ 2796
- poj 2796
- poj 2796
- POJ 2796
- poj 2796
- poj 2796
- poj 2796
- poj 2796 数字求和
- poj 2796 Feel Good
- poj 2796#单调栈
- POJ 2796 Feel Good
- POJ 2796 Feel Good
- poj 2796 Feel Good
- poj 2796 feel good
- POJ 2796 单调栈~
- POJ-2796-Feel Good
- POJ 2796Feel Good
- poj 2796 Feel Good
- 史上最强在Myeclipse上安装插件的方法(以 aptana为例)
- windows下硬盘安装redhat5
- SQL Server 2012中新的T-SQL命令第一部分
- .net中linkbutton增加js验证
- Oracle百万记录sql语句优化技巧【转】
- poj 2796
- 第八天 T-SQL小结以及SQL Server 的一些操作小结
- using "cout" after "sscanf" gets two output
- Heap & HeapSort (using template)
- 判断一个数字是否是回文
- viewWillAppear: not being called inside a UINavigationController
- Struts2学习笔记之动态方法调用和参数获取
- 大作坊小项目的 管理实施小总结。
- 在3I工作室正式成立揭牌仪式上,3I工作室得到了来自教育厅、学校和学院相关领导的肯定与赞扬