牛客小白月赛13 小A的柱状图 （线段树求最值及其下标+二分）

https://ac.nowcoder.com/acm/contest/549/H

题解：（正解单调栈），但是比赛的时候第一反应线段树二分所以就写了棵线段树

 

维护区间最小值，并且记录最小值下标，然后从1~n开始二分，每次找到最小值后，再找这个最小值左右两边的区间最小值，然后再维护一个区间和就ojbk了，思路很简单

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<vector> 
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mem(a,b) memset(a,b,sizeof(a));
#define lowbit(x)  x&-x;  
#define debugint(name,x) printf("%s: %d\n",name,x);
#define debugstring(name,x) printf("%s: %s\n",name,x);
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int mod = 1e9+7;

const int maxn=1000000+5;
ll a[maxn];
ll A[maxn];
int n;
struct node
{
    int id;
    int left,right;
    ll min;
}num[maxn*4];

//建树
pair<int,ll> build(int left,int right,int cnt)
{
    int mid;
    num[cnt].left=left;
    num[cnt].right=right;
    if(left==right)
    {
        num[cnt].id=left;
        num[cnt].min=A[left];
        return make_pair(left,A[left]);
    }
    mid=(left+right)>>1;

    pair<int,ll> r1=build(left,mid,cnt*2);
    pair<int,ll> r2=build(mid+1,right,cnt*2+1);
    if(r1.second<r2.second)
    {
        num[cnt].id=r1.first;
        num[cnt].min=r1.second;
        return r1;
    }
    else
    {
        num[cnt].id=r2.first;
        num[cnt].min=r2.second;
        return r2;
    }
}

//返回pair类型，first为下标，second为最小值
pair<int,ll> query(int left,int right,int cnt)
{
    int mid;
    if(left==num[cnt].left&&right==num[cnt].right)
        return make_pair(num[cnt].id,num[cnt].min);
    mid=(num[cnt].left+num[cnt].right)>>1;

    if(right<=mid)
        return query(left,right,cnt*2);
    else if(left>mid)
        return query(left,right,cnt*2+1);
    else
    {
        pair<int,ll> r1=query(left,mid,cnt*2);
        pair<int,ll> r2=query(mid+1,right,cnt*2+1);
        return r1.second<r2.second?r1:r2;
    }
}


ll ans = 0;
int sum[maxn];
void dfs(int l,int r){
    if(l > r) return;
    if(l == r){
        ans = max(ans,1ll*a[l]*A[l]);
        return;
    }
    int tmp = sum[r]-sum[l-1];
    pair<ll,int> c = query(l,r,1);
    //cout<<minn<<endl;
    ll minn = c.second;
    int id = c.first;
    ans = max(ans,minn*tmp);
    dfs(l,id-1);
    dfs(id+1,r);
}

int main(){
    scanf("%d",&n);
    for(int i = 1; i <= n; i++){
        scanf("%d",&a[i]);
        sum[i] = sum[i-1]+a[i];
    }
    for(int i = 1; i <= n; i++){
        scanf("%lld",&A[i]);
    }
    build(1,n,1);
    dfs(1,n);
    printf("%lld\n",ans);
}