ZOJ 2642 Feel Good (单调栈)

大体题意：

给你n 个数，要求找一个区间[l,r] 使得区间中的最小值 × 区间和 的值最大？

思路：

直接单调栈即可！

枚举每一个数作为最小值，找到 la[i]和ne[i]即 前面的边界和后面的边界！

枚举更新一下答案即可！

注意开long long

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>

using namespace std;
const int maxn = 100000 + 7;
const int inf = 0x3f3f3f3f;

struct Node{
    int v;
    int id;
    Node(int v = 0,int id = 0):v(v),id(id){}
    void read(int i){
        id = i;
        scanf("%d",&v);
    }
}a[maxn];
stack<Node>sk;
int la[maxn], ne[maxn];
long long sum[maxn];
int main(){
    int n;
    while(~scanf("%d",&n)){
        for (int i = 1; i <= n; ++i){
            a[i].read(i);
            sum[i] = sum[i-1] + (long long )a[i].v;
        }
        while(!sk.empty())sk.pop();
        sk.push(Node(-inf,0));
        for (int i = 1; i <= n; ++i){
            while(sk.top().v >= a[i].v) sk.pop();
            la[i] = sk.top().id;
            sk.push(a[i]);
        }
        while(!sk.empty())sk.pop();
        sk.push(Node(-inf,n+1));
        for (int i = n; i >= 1; --i){
            while(sk.top().v >= a[i].v) sk.pop();
            ne[i] = sk.top().id;
            sk.push(a[i]);
        }
        long long ans=-inf;
        int p1,p2;
        for (int i = 1; i <= n; ++i){
            long long  t = (long long)a[i].v * (sum[ne[i]-1 ] - sum[la[i]]);
            if (t > ans){
                ans = t;
                p1 = la[i]+1;
                p2 = ne[i] - 1;

            }

        }
        printf("%lld\n%d %d\n", ans, p1, p2);
    }


    return 0;
}

Feel Good

---

Time Limit: 10 Seconds       Memory Limit: 32768 KB       Special Judge

---

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

There are several test cases in the input file. The first line of each case 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 10⁶ - the emotional values of the days. Numbers are separated by spaces and/or line breaks. Proceed to the end of file.

Output

For each test case, 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:  Northeastern Europe 2005
Submit     Status