POJ 2796 Feel Good 单调

题意：$n\leq 10^6$

$$\max_{1\leq i\leq j\leq n} \left\{ \min_{i\leq k\leq j} a_k\times\sum_{i\leq k\leq j} a_k \right\}$$
不知道能不能这么写。。
总之就是给出一串数，求某个区间的其内最小值与其和的乘积的最大值。

由于区间是$O(n^2)$的，因此枚举区间做暴力的时间为$O(n^2)$，因此考虑枚举最小值。
如果某个$a_i$是区间的最小值，那么往左往右延伸做暴力的时间是$O(n^2)$，仍然不合要求，但是发现左右延伸实际做了很多多余的计算，考虑减少这些运算。
试想如何能在扫描到某个点就能知道其向左延伸距离？似乎可以使用单调线性数据结构，这里用单调增结构。
如果对其操作，扫描到某个点就将其加入，期间弹出来的所有点都比该点大，那么向左延伸的距离就显而易见了。对于弹出的点，向右延伸的距离也得知了，因为我们加入的点是该节点向右延伸第一个比其小的点。
因此问题就解决了。。时间复杂度$O(n)$。
然而单调队列单调栈什么的并没有区别。。。

我一脸懵逼。
交C++ 1200MS。。G++ 125MS直接飞到第一页
不过32MS的好强。

#include <cstdio>
const int N = 100005;

inline int read() {
    int s = 0, f = 1; char ch = getchar();
    for (; ch < '0' || ch > '9'; ch = getchar()) if (ch == '-') f = -1;
    for (; '0' <= ch && ch <= '9'; ch = getchar()) s = s * 10 + ch - '0';
    return s * f;
}

int a[N], l[N], q[N];
long long s[N];

int main() {
    long long ans = -1, t;
    int n = read(), r = 0, i, u, ansl, ansr;
    for (i = 1; i <= n; i++)
        a[i] = read(), s[i] = s[i - 1] + a[i];
    a[++n] = -1;
    for (i = 1; i <= n; i++)
        if (r == 0 || a[i] > a[q[r]])
            q[++r] = i, l[i] = i;
        else if (a[i] < a[q[r]]) {
            while (r && a[i] < a[q[r]]) {
                u = q[r--];
                t = (s[i - 1] - s[l[u] - 1]) * a[u];
                if (t > ans)
                    ansl = l[u], ansr = i - 1, ans = t;
            }
            l[i] = l[q[r + 1]];
            q[++r] = i;
        }
    printf("%I64d\n%d %d", ans, ansl, ansr);
    return 0;
}

Feel Good

Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 11972 Accepted: 3322
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.
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