【线段树】Gym - 101334F Feel Good

Step1 Problem:

输入n,给你n个数下标分别从1到n, 让你求连续的序列 它们的和 * 它们的最小值 最大。
输出最大值 和 序列左端点 和 序列右端点
例：
6
3 1 6 4 5 2
输出：
60
3 5
数据范围：
1 <= n <= 100000, 数a[i]的范围[0, 1e6].

Step2 Involving algorithms

线段树

Step3 Ideas:

lt[i]: 从i下标向左 第一个比a[i]小的 下标
从左到右，用线段树维护比a[i]小的区间下标最大
rt[i]: 从i下标向右 第一个比a[i]小的 下标
从右到左，用线段树维护比a[i]小的区间下标最小
暴力每个a[i]都是最小值，求结果。

Step4 Code:

#include<bits/stdc++.h>
using namespace std;
#define lson root<<1
#define rson root<<1|1
#define MID int mid = (l+r)/2
#define ll long long
const int N = 1e5+100;
const int inf = 0x3f3f3f3f;
const int M = 1e6;
int tree[M<<2], lt[N], rt[N], a[N];
ll sum[N];
void updata(int root, int l, int r, int pos, int v, int ok)
{
    if(l == r)
    {
        tree[root] = v;
        return ;
    }
    MID;
    if(pos <= mid)
        updata(lson, l, mid, pos, v, ok);
    else updata(rson, mid+1, r, pos, v, ok);
    if(ok)
    tree[root] =  max(tree[lson], tree[rson]);
    else tree[root] = min(tree[lson], tree[rson]);
}
int query(int root, int l, int r, int ul, int ur, int ok)
{
    //printf("%d %d %d\n", l, r, (l+r)/2);
    if(ul > ur) {
        if(ok)
        return 0;
        else return inf;
    }
    if(ul <= l && r <= ur)
    {
        return tree[root];
    }
    int res = ok?0:inf;
    MID;
    if(mid >= ul)
    {
        if(ok)
        res = max(res, query(lson, l, mid, ul, ur, ok));
        else res = min(res, query(lson, l, mid, ul, ur, ok));
    }
    if(mid < ur)
    {
        if(ok)
            res = max(res, query(rson, mid+1, r, ul, ur, ok));
        else res = min(res, query(rson, mid+1, r, ul, ur, ok));
    }
    return res;
}
int main()
{
    freopen("feelgood.in", "r", stdin);
    freopen("feelgood.out", "w", stdout);
    int n;
    cin >> n;
    memset(sum, 0, sizeof(sum));
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        sum[i] = sum[i-1] + a[i];
    }
    memset(tree, 0, sizeof(tree));
    for(int i = 1; i <= n; i++)
    {
        int t = query(1, 0, M, 0, a[i]-1, 1);
        lt[i] = i - t - 1;
        updata(1, 0, M, a[i], i, 1);
    }
    memset(tree, inf, sizeof(tree));
    for(int i = n; i >= 1; i--)
    {
        int t = query(1, 0, M, 0, a[i]-1, 0);
        if(t >= inf) t = n+1;
        rt[i] = t - i - 1;
        updata(1, 0, M, a[i], i, 0);
    }
    ll ans = -1;
    int id;
    for(int i = 1; i <= n; i++)
    {
        ll t = sum[i+rt[i]] - sum[i - 1 - lt[i]];
       // printf("%d %d %d\n", i+rt[i], i - 1 - lt[i], t);
        if(t*a[i] > ans) {
            ans = t*a[i];
            id = i;
        }
    }
    cout << ans << endl;
    printf("%d %d\n", id-lt[id], id+rt[id]);
    return 0;
}