【POJ2796】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

题目大意:
n个数，求某段区间的最小值*该段区间所有元素之和的最大值

思路：
其实这道题的思路和之前的【POJ2559】Largest Rectangle in a Histogram思路差不多，也是往左往右拓展，记录它在哪个区间内为最小值，然后在开头做一个前缀和，最后直接计算最小*总和有没有大于答案

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;
long long n, sum[10001000];
struct node{
	long long w,l,r;
}a[10001000];
int main(){
	scanf("%lld", &n);
	for(long long i=1; i<=n; i++)
	{
		scanf("%lld", &a[i].w);
		sum[i]=a[i].w+sum[i-1];
		a[i].l=a[i].r=i;
	}
	stack<long long>q;
	for(long long i=1; i<=n; i++)
	{
		while(!q.empty()&&a[i].w<=a[q.top()].w)
		{
			a[i].l=a[q.top()].l;
			q.pop();
		}
		q.push(i);
	}
	while(!q.empty())q.pop();
	for(long long i=n; i>=1; i--)
	{
		while(!q.empty()&&a[i].w<=a[q.top()].w)
		{
			a[i].r=a[q.top()].r;
			q.pop();
		}
		q.push(i);
	}
	long long ans=0,l1=1,r1=1;
	for(long long i=1; i<=n; i++)
		if(a[i].w*(sum[a[i].r]-sum[a[i].l-1])>ans)
			ans=a[i].w*(sum[a[i].r]-sum[a[i].l-1]),
			l1=a[i].l,
			r1=a[i].r;
	printf("%lld\n%lld %lld", ans, l1, r1);
	return 0;
}