单调栈+RMQ

单调栈+RMQ

贴上单调栈介绍:
https://blog.csdn.net/qq_43333395/article/details/89426429
贴上RMQ介绍:
https://blog.csdn.net/qq_43333395/article/details/89442824

例题一 区间的价值

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5696

题意

给出一个长度为n(1 <= n <= 100000)的序列,区间权值为区间最大值乘以区间最小值,输出长度为1到n的区间的最大权值。

题解

先利用单调栈算出以a[i]为最小值的最大区间延伸,设该区间宽度为L,则更新ans[L](这里用到st表查询该区间最大值),最后从宽度较大的区间刷新宽度较小的区间的长度,即为答案。

为什么是对的,可以证明一下,从结果考虑,宽度为k的区间的最优值一定可以被这种方式取到。
ac代码:

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long lint;
#define maxn (100010)
#define left lleft
#define right rright
#define log2 Log2
int a[maxn], left[maxn], right[maxn];
lint ans[maxn];
int log2[maxn], st[maxn][32];
void st_prepare(int arr[], int n)
{
    log2[1] = 0;
    for(int i = 2; i <= n; i++)
    {
        log2[i] = log2[i-1];
        if((1 << log2[i] + 1) == i)
            log2[i]++;
    }
    for(int i = n-1; i >= 0; i--)
    {
        st[i][0] = arr[i];
        for(int j = 1; i + (1 << j) - 1 < n; j++)
        {
            st[i][j] = max(st[i][j-1], st[i+(1<<j-1)][j-1]);
        }
    }
}
int st_query(int l, int r)
{
    int len = log2[r - l + 1];
    return max(st[l][len], st[r - (1 << len) + 1][len]);
}
#define stack Stack
pair<int, int> stack[maxn];
int top;
void push_stack(int id, int w, int val[], int mx)
{
    while(top > 0)
    {
        if(stack[top].first < w)
            break;
        top--;
    }
    if(!top) val[id] = mx;
    else val[id] = stack[top].second;
    stack[++top] = make_pair(w, id);
}
int main()
{
    int n;
    while(cin >> n)
    {
        for(int i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        st_prepare(a + 1, n);
        top = 0;
        for(int i = 1; i <= n; i++)
        {
            push_stack(i, a[i], left, 0);
        }
        top = 0;
        for(int i = n; i >= 1; i--)
        {
            push_stack(i, a[i], right, n + 1);
        }
        for(int i = 0; i <= n; i++) ans[i] = -1;
        for(int i = 1, l, r, k; i <= n; i++)
        {
            l = left[i];
            r = right[i] - 2;
            k = st_query(l, r);
            ans[r - l + 1] = max(ans[r - l + 1], (lint)k * a[i]);
        }
        for(int i = n - 1; i >= 1; i--)
            ans[i] = max(ans[i], ans[i + 1]);
        for(int i = 1; i <= n; i++)
            printf("%I64d\n", ans[i]);
    }

    return 0;
}

自己代码:(ac了,具体模板参照上面两个链接)

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <iostream>
#include <stack>
using namespace std;
typedef long long ll;
const int N=100010;
ll arr[N];
ll dp[N][35],n;
ll L[N],R[N];
ll ans[N];
//rmq的建立
void rmq_init(){

    for(int i=1;i<=n;i++)
        dp[i][0]=arr[i];
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j+(1<<i)-1<=n;j++)
        dp[j][i]=max(dp[j][i-1],dp[j+(1<<(i-1))][i-1]);

}

//rmq的查询
ll rmq_qui(int l,int r){
    int k=(int)log2(double(r-l+1));//不要写成log(double)(r-l+1)/log(2.0);会wa
    return max(dp[l][k],dp[r-(1<<k)+1][k]);
}

void single_stack_l(){
    stack<int >S;
    while(S.size()) S.pop();
    S.push(0);
    for(int i=1;i<=n;i++){
        while(S.size()&&arr[S.top()]>=arr[i]) S.pop();

        if(S.empty()) L[i]=0;
        else L[i]=S.top();

        S.push(i);
    }
}

void single_stack_r(){
    stack<int>S;
    while(S.size()) S.pop();
    S.push(n+1);
    for(int i=n;i>=1;i--){
        while(S.size()&&arr[S.top()]>=arr[i]) S.pop();

        if(S.empty()) R[i]=n+1;
        else R[i]=S.top();

        S.push(i);
    }
}


int main(){
    int a,b;
    while(~scanf("%lld",&n)&&n){
    memset(dp,0,sizeof(dp));
    memset(arr,0,sizeof(arr));
    memset(L,0,sizeof(L));
    memset(R,0,sizeof(R));
    memset(ans,0,sizeof(ans));
    for(int i=1;i<=n;i++)
        scanf("%lld",&arr[i]);
        arr[0]=arr[n+1]=INT_MIN;
    rmq_init();
    int q,p;

    single_stack_l();
    single_stack_r();

    for(int i=0;i<=n;i++) ans[i]=-1;
    for(int i=1,l,r,k;i<=n;i++){
        l=L[i];
        r=R[i]-2;
        k=rmq_qui(l+1,r+1);
        ans[r-l+1]=max(ans[r-l+1],(ll)k*arr[i]);
    }
    for(int i=n-1;i>=1;i--)
            ans[i]=max(ans[i],ans[i+1]);
    for(int i=1;i<=n;i++)
            printf("%lld\n",ans[i]);
    }
            return 0;
}

例题二 Max answer

链接:https://nanti.jisuanke.com/t/38228

题目大意:

选一段区间,用最小值乘与区间的所有值,问能求得的最大值是多少。
(如果最小值只能是正数,则可以用单调栈,但是含有负数,则用单调栈+RMQ)

#include <bits/stdc++.h>

using namespace std;
#define LL long long
#define fi first
#define se second
#define pb push_back
#define ls rt<<1, l, m
#define rs rt<<1|1, m+1, r
const int N = 5e5 + 5;
int a[N], pre[N], suf[N];
LL sum[N], mx[N<<2], mn[N<<2];
stack<int> st;
int n;
void push_up(int rt) {
    mn[rt] = min(mn[rt<<1], mn[rt<<1|1]);
    mx[rt] = max(mx[rt<<1], mx[rt<<1|1]);
}
void build(int rt, int l, int r) {
    if(l == r) {
        mx[rt] = mn[rt] = sum[l];
        return ;
    }
    int m = l+r >> 1;
    build(ls);
    build(rs);
    push_up(rt);
}
LL querymx(int L, int R, int rt, int l, int r) {
    if(L <= l && r <= R) return mx[rt];
    int m = l+r >> 1;
    LL ans = LONG_MIN;
    if(L <= m) ans = max(ans, querymx(L, R, ls));
    if(R > m) ans = max(ans, querymx(L, R, rs));
    return ans;
}
LL querymn(int L, int R, int rt, int l, int r) {
    if(L <= l && r <= R) return mn[rt];
    int m = l+r >> 1;
    LL ans = LONG_MAX;
    if(L <= m) ans = min(ans, querymn(L, R, ls));
    if(R > m) ans = min(ans, querymn(L, R, rs));
    return ans;
}
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    for (int i = 1; i <= n; ++i) sum[i] = sum[i-1] + a[i];
    build(1, 0, n);
    a[0] = a[n+1] = INT_MIN;
    st.push(0);
    for (int i = 1; i <= n; ++i) {
        while(!st.empty() && a[st.top()] >= a[i]) st.pop();
        pre[i] = st.top();
        st.push(i);
    }
    while(!st.empty()) st.pop();
    st.push(n+1);
    for (int i = n; i >= 1; --i) {
        while(!st.empty() && a[st.top()] >= a[i]) st.pop();
        suf[i] = st.top();
        st.push(i);
    }
    LL ans = 0;
    for (int i = 1; i <= n; ++i) {
        int l = pre[i], r = i-1;
        int ll = i, rr = suf[i]-1;
        if(a[i] < 0) {
            ans = max(ans, a[i]*(querymn(ll, rr, 1, 0, n)-querymx(l, r, 1, 0, n)));
        }
        else if(a[i] > 0) {
            ans = max(ans, a[i]*(querymx(ll, rr, 1, 0, n)-querymn(l, r, 1, 0, n)));
        }
    }
    printf("%lld\n", ans);
    return 0;
}

自己的代码:(wa了一个点呜呜呜)

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <iostream>
#include <stack>
using namespace std;
typedef long long ll;
const int N=500005;
ll arr[N];
ll dp[N][31],n,pd[N][31];
int L[N],R[N];
ll sum[N];
//rmq的建立
void rmq_init(){
    for(int i=1;i<=n;i++)
        dp[i][0]=sum[i];
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j+(1<<i)-1<=n;j++)
        dp[j][i]=max(dp[j][i-1],dp[j+(1<<(i-1))][i-1]);
    for(int i=1;i<=n;i++)
        pd[i][0]=sum[i];
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j+(1<<i)-1<=n;j++)
        pd[j][i]=min(pd[j][i-1],pd[j+(1<<(i-1))][i-1]);
}

//rmq的查询
ll rmq_qui_max(int l,int r){
    int k=(int)log2(double(r-l+1));
    return max(dp[l][k],dp[r-(1<<k)+1][k]);
}
ll rmq_qui_min(int l,int r){
    int k=(int)log2(double(r-l+1));
    return min(pd[l][k],pd[r-(1<<k)+1][k]);
}

void single_stack_l(){
    stack<int>S;
    while(S.size()) S.pop();
    S.push(0);
    for(int i=1;i<=n;i++){
        while(S.size()&&arr[S.top()]>=arr[i]) S.pop();
        if(S.empty()) L[i]=0;
        else
        L[i]=S.top();

        S.push(i);
    }
}

void single_stack_r(){
    stack<int>S;
    while(S.size()) S.pop();
    S.push(n+1);
    for(int i=n;i>=1;i--){
        while(S.size()&&arr[S.top()]>=arr[i]) S.pop();
        if(S.empty()) R[i]=n+1;
        else
         R[i]=S.top();

        S.push(i);
    }
}


int main(){
    scanf("%lld",&n);
    arr[0]=arr[n+1]=-1e9;
    for(int i=1;i<=n;i++)
        scanf("%lld",&arr[i]);
    sum[0]=0;
    for(int i=1;i<=n;i++)sum[i]=sum[i-1]+arr[i];
    rmq_init();
    single_stack_l();
    single_stack_r();

    ll ans=-1e18;
    for (int i=1;i<=n;i++) {
        int l=L[i],r=i-1;
        int ll=i,rr=R[i]-1;
        if(arr[i]<0) {
            ans=max(ans,arr[i]*(rmq_qui_min(ll, rr)-rmq_qui_max(l, r)));
        }
        else if(arr[i]>=0) {
            ans=max(ans,arr[i]*(rmq_qui_max(ll, rr)-rmq_qui_min(l, r)));
            }
        }
        printf("%lld\n",ans);
        return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值