CF 487B Strip（线段树优化DP）

CF 487B Strip

题目描述

Alexandra has a paper strip with $n$ numbers on it. Let’s call them $a_i$ from left to right.
Now Alexandra wants to split it into some pieces (possibly $1$ ). For each piece of strip, it must satisfy:

• Each piece should contain at least $l$ numbers.
• The difference between the maximal and the minimal number on the piece should be at most $s$.
  Please help Alexandra to find the minimal number of pieces meeting the condition above.

输入格式

Alexandra has a paper strip with $n$ numbers on it. Let’s call them $a_i$ from left to right.

Now Alexandra wants to split it into some pieces (possibly $1$). For each piece of strip, it must satisfy:

• Each piece should contain at least $l$ numbers.
• The difference between the maximal and the minimal number on the piece should be at most $s$.

Please help Alexandra to find the minimal number of pieces meeting the condition above.

输出格式

Output the minimal number of strip pieces.

If there are no ways to split the strip, output -1.

Sample Input 1

7 2 2
1 3 1 2 4 1 2

Sample Output 1

3

Sample Input 2

7 2 2
1 100 1 100 1 100 1

Sample Input 2

-1

$1\le n,l\le 10^5,1\le s\le 10^9,-10^9\le a_i\le 10^9$

题目大意

给出一个长度为$n$的数组，要求将其按原来的顺序分成若干份且各部分满足以下两个条件：

• 每个部分至少有$l$个元素
• 每个部分中最大值和最小值之差不能超过$s$

问最多可以将这些元素分成几个部分。如果无法分这个数组，就输出-1

题解

前置知识：线段树优化DP
很容易推出状态转移式为：

$f_i=\max f_j+1$，其中$j$满足$1\le j\le i-l$且$j+1$到$i$的最大值与最小值之差小于等于$s$

首先，我们可以用单调队列来维护目前区间的最大值和最小值，如果两者差大于$s$则将区间左结点向右移，直到差小于等于$s$

然后，我们可以将$a_i$离散化一下，再用权值线段树来维护值为$k$的$a_i$的最大的$f_i$的值。对于每个$f_i$，在线段树上查找对应的位置中的最大值，用这个值加一来更新$f_i$，再用$f_i$更新$a_i$位置即可。

单调队列平摊下来是$O(n)$的，线段树区间查询和单点修改都是$O(nlogn)$，所以总时间复杂度为$O(nlogn)$

code

#include<iostream>
#include<cstdio>
#define lc k<<1
#define rc k<<1|1
using namespace std;
int n,s,l,a1=1,a2=0,b1=1,b2=0,sum,va=0,vb=0,inf=1000000000,a[100005],f[100005],ha[100005],hb[100005],tr[400005];
void build(int k,int l,int r){
    tr[k]=inf;
    if(l==r) return;
    int mid=(l+r)/2;
    build(lc,l,mid);build(rc,mid+1,r);
}
void pt(int k,int l,int r,int x,int y){
    if(l==r&&l==x){
        tr[k]=y;
        return;
    }
    if(l>x||r<x) return;
    if(l==r) return;
    int mid=(l+r)/2;
    if(x<=mid) pt(lc,l,mid,x,y);
    else pt(rc,mid+1,r,x,y);
    tr[k]=min(tr[lc],tr[rc]);
}
void find(int k,int l,int r,int x,int y){
    if(l>=x&&r<=y){
        sum=min(sum,tr[k]);
        return;
    }
    if(l>y||r<x) return;
    if(l==r) return;
    int mid=(l+r)/2;
    if(x<=mid) find(lc,l,mid,x,y);
    if(y>mid) find(rc,mid+1,r,x,y);
}
int main()
{
    while(scanf("%d%d%d",&n,&s,&l)!=EOF){
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            f[i]=inf;
        }
        a1=1,a2=0,b1=1,b2=0,va=0,vb=0;
        build(1,1,n);
        for(int i=1;i<l;i++){
            while(a1<=a2&&a[ha[a2]]<a[i]) --a2;
            ha[++a2]=i;
            while(b1<=b2&&a[hb[b2]]>a[i]) --b2;
            hb[++b2]=i;
        }
        for(int i=l;i<=n;i++){
            while(a1<=a2&&a[ha[a2]]<a[i]) --a2;
            ha[++a2]=i;
            while(b1<=b2&&a[hb[b2]]>a[i]) --b2;
            hb[++b2]=i;
            while(a1<=a2&&b1<=b2&&a[ha[a1]]-a[hb[b1]]>s){
                if(ha[a1]<hb[b1]) va=ha[a1],++a1;
                else vb=hb[b1],++b1;
            }
            int lt=max(va,vb),rt=i-l;
            if(lt==0) f[i]=1;
            else{
                sum=inf;
                if(lt<=rt) find(1,1,n,lt,rt);
                f[i]=sum+1;
            }
            pt(1,1,n,i,f[i]);
        }
        if(f[n]>=inf) printf("-1");
        else printf("%d",f[n]);
    }
    return 0;
}