POJ2796 Feel Good
Feel Good
| Time Limit: 3000MS | Memory Limit: 65536K | |
| Case 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
6
3 1 6 4 5 2
Sample Output
60
3 5
Source
单调栈基本应用
1 #include<set>
2 #include<cstdio>
3 #include<cstdlib>
4 #include<cstring>
5 #include<iostream>
6 #include<algorithm>
7 using namespace std;
8 const int N = 100010;
9 const int inf = 2147483647;
10 #define For(i,n) for(int i=1;i<=n;i++)
11 #define Rep(i,l,r) for(int i=l;i<=r;i++)
12 int st[N],A[N],n;
13 long long sum[N];
14 int main(){
15 while(~scanf("%d",&n)){
16 For(i,n){
17 scanf("%d",&A[i]);
18 sum[i]=sum[i-1]+A[i];
19 }
20 A[n+1]=-1;
21 long long ans=-1,tmp;
22 int top=0,l,r;
23 For(i,n+1){
24 while(top!=0&&A[st[top]]>A[i]){
25 tmp=A[st[top]]*(sum[i-1]-sum[st[top-1]]);
26 if(ans<tmp){
27 ans=tmp;
28 l=st[top-1]+1;
29 r=i-1;
30 }
31 top--;
32 }
33 top++;
34 st[top]=i;
35 }
36 printf("%lld\n%d %d\n",ans,l,r);
37 }
38 }
