CodeForces - 1418D. Trash Problem 线段树+离散化/set维护

CodeForces - 1418D. Trash Problem 线段树+离散化/set维护

不难想到，最后的 a n s = m a x { a [ i ] } − m i n { a [ i ] } − m a x { a [ i ] − a [ i − 1 ] } ans=max\{a[i]\}-min\{a[i]\}-max\{a[i]-a[i-1]\} ans=max{a[i]}−min{a[i]}−max{a[i]−a[i−1]}

一、线段树做法

维护区间的最大值，最小值，和区间最大的相邻差值
需要用到离线，将所有的点都放入数组才能离散化，然后构造线段树的过程中，记录下哪些点是尚未加入的。如果是尚未加入的，那么其最大值和最小值都取0，作为一个标记。

push_up函数中需要注意的是，两个子区间合并的时候，交汇处也会产生一个相邻差值，即等于$tree[rt<<1|].minn-tree[rt<<1].maxx$

代码:

const int maxn=2e5+7;
const int INF=0x3f3f3f3f;
const ll INFF=1e18;
int n,q,a[maxn],b[maxn],op[maxn],x[maxn],aa[maxn],m=0;
bool ok[maxn];
struct node
{
    int maxx,minn,cha;
}tree[maxn<<2];
void init()
{
    sort(a+1,a+1+n+q);
    rep(i,1,n+q)if (i==1||a[i]!=a[i-1])b[++m]=a[i];
}
int query(int x){return lower_bound(b+1,b+1+m,x)-b;}
void pu(int rt)
{
    tree[rt].maxx=max(tree[rt<<1].maxx,tree[rt<<1|1].maxx);

    if (tree[rt<<1].minn==0||tree[rt<<1|1].minn==0)tree[rt].minn=max(tree[rt<<1].minn,tree[rt<<1|1].minn);
    else tree[rt].minn=min(tree[rt<<1].minn,tree[rt<<1|1].minn);

    tree[rt].cha=max(tree[rt<<1].cha,tree[rt<<1|1].cha);
    if (tree[rt<<1].maxx!=0&&tree[rt<<1|1].minn!=0)tree[rt].cha=max(tree[rt].cha,tree[rt<<1|1].minn-tree[rt<<1].maxx);

}
void build(int rt,int l,int r)
{
    if (l==r)
    {
        if (ok[l])tree[rt].maxx=tree[rt].minn=b[l];
        else tree[rt].maxx=tree[rt].minn=0;
        tree[rt].cha=0;
        return;
    }
    int mid=(l+r)>>1;
    build(lson);
    build(rson);
    pu(rt);
}
void update(int rt,int l,int r,int x,int option)
{
    if (l==r)
    {
        if (option==1)tree[rt].maxx=tree[rt].minn=b[l];
        else tree[rt].maxx=tree[rt].minn=0;
        tree[rt].cha=0;
        return;
    }
    int mid=(l+r)>>1;
    if (x<=mid)update(lson,x,option);
    else update(rson,x,option);
    pu(rt);
}
int solve()
{
    return tree[1].maxx-tree[1].minn-tree[1].cha;
}
int main()
{
    mem(ok,false);
    scanf("%d%d",&n,&q);
    rep(i,1,n)scanf("%d",&a[i]),aa[i]=a[i];
    rep(i,1,q)scanf("%d%d",&op[i],&x[i]),a[n+i]=x[i];
    init();
    rep(i,1,n)ok[query(aa[i])]=true;
    build(1,1,m);
    W(solve());
    rep(i,1,q)
    {
        update(1,1,m,query(x[i]),op[i]);
        W(solve());
    }
    return 0;
}

二、SET维护

想到了很简单， 但是就是想不到
都忘记迭代器的–和++取相邻元素了
可以用map维护差值的个数
看了别人的题解，比较巧妙地是用到了multiset，可以放重复元素，删除的时候如果用迭代器就可以只删除一个，就避免了set一下全删完的情况，也就可以不用map那么麻烦了。
不用multiset的代码:

const int maxn=2e6+7;
const int INF=0x3f3f3f3f;
const ll INFF=1e18;
int a[maxn],n,q,op,x;
set<int> S,T;
map<int,int> M;
set<int> ::iterator it;
int pre(int x)
{
    it=S.find(x);
    if (it==S.begin())return 0;
    else return *(--it);
}
int next(int x)
{
    it=S.find(x);++it;
    if (it==S.end())return 0;
    else return *it;
}
void insert_x(int x)
{
    S.insert(x);
    int pre_x=pre(x);
    int next_x=next(x);
    if (pre_x)
    {
        if (M[x-pre_x]==0)T.insert(x-pre_x);
        M[x-pre_x]++;
    }
    if (next_x)
    {
        if (M[next_x-x]==0)T.insert(next_x-x);
        M[next_x-x]++;
    }
    if (pre_x&&next_x)
    {
        if (M[next_x-pre_x]==1)T.erase(next_x-pre_x);
        M[next_x-pre_x]--;
    }
}
void delete_x(int x)
{
    int pre_x=pre(x);
    int next_x=next(x);
    S.erase(x);
    if (pre_x)
    {
        if (M[x-pre_x]==1)T.erase(x-pre_x);
        M[x-pre_x]--;
    }
    if (next_x)
    {
        if (M[next_x-x]==1)T.erase(next_x-x);
        M[next_x-x]--;
    }
    if (pre_x&&next_x)
    {
        if (M[next_x-pre_x]==0)T.insert(next_x-pre_x);
        M[next_x-pre_x]++;
    }
}
int query()
{
    if (S.size()<=1)return 0;
    return *S.rbegin()-*S.begin()-*T.rbegin();
}
int main()
{
    S.clear();T.clear();
    scanf("%d%d",&n,&q);
    rep(i,1,n)scanf("%d",&a[i]),insert_x(a[i]);
    W(query());
    rep(i,1,q)
    {
        scanf("%d%d",&op,&x);
        if (op)insert_x(x);
        else delete_x(x);
        W(query());
    }
    return 0;
}

用multiset的代码:

const int maxn=2e6+7;
const int INF=0x3f3f3f3f;
const ll INFF=1e18;
int a[maxn],n,q,op,x;
set<int> S;
multiset<int> T;
set<int> ::iterator it;
int pre(int x)
{
    it=S.find(x);
    if (it==S.begin())return 0;
    else return *(--it);
}
int next(int x)
{
    it=S.find(x);++it;
    if (it==S.end())return 0;
    else return *it;
}
void insert_x(int x)
{
    S.insert(x);
    int pre_x=pre(x);
    int next_x=next(x);
    if (pre_x)T.insert(x-pre_x);
    if (next_x)T.insert(next_x-x);
    if (pre_x&&next_x)T.erase(T.find(next_x-pre_x));
}
void delete_x(int x)
{
    int pre_x=pre(x);
    int next_x=next(x);
    S.erase(x);
    if (pre_x)T.erase(T.find(x-pre_x));
    if (next_x)T.erase(T.find(next_x-x));
    if (pre_x&&next_x)T.insert(next_x-pre_x);
}
int query()
{
    if (S.size()<=1)return 0;
    return *S.rbegin()-*S.begin()-*T.rbegin();
}
int main()
{
    S.clear();T.clear();
    scanf("%d%d",&n,&q);
    rep(i,1,n)scanf("%d",&a[i]),insert_x(a[i]);
    W(query());
    rep(i,1,q)
    {
        scanf("%d%d",&op,&x);
        if (op)insert_x(x);
        else delete_x(x);
        W(query());
    }
    return 0;
}