codeforces_1187_D

https://codeforces.com/contest/1187/problem/D

题意：给一个数组a,一个数组b,每次可以选择数组a的一个区间并从小到大排序,问是否可以将数组a变成数组b。

思路：https://blog.csdn.net/Frozensmile/article/details/94366486

注意：调用empty()和pop()清空队列在多组数据时有可能会清不掉。建议以后使用如下语句清空队列：

void clear(queue<int>& q) {
    queue<int> empty;
    swap(empty, q);
}

代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#define inf 0x3f3f3f3f
using namespace std;
const int MAXN=3e5+5;
int ppp=0;
int a[MAXN],b[MAXN];
queue<int>pos[MAXN];
void clear(queue<int>& q) {
    queue<int> empty;
    swap(empty, q);
}
struct node{
    int l,r;//区间[l,r]
    int add;//区间的延时标记
    int mn; //区间最小值
}tree[MAXN<<2];
 
void pushup(int i){
    tree[i].mn = min(tree[i<<1].mn,tree[i<<1|1].mn);
}
void pushdown(int i){
    if(tree[i].add){
        tree[i<<1].mn = tree[i].add;
        tree[i<<1|1].mn = tree[i].add;
        tree[i<<1].add = tree[i].add;
        tree[i<<1|1].add = tree[i].add;
        tree[i].add = 0;
    }
}
void build(int l,int r,int i){
    tree[i].l = l;
    tree[i].r = r;
    tree[i].add = 0;//刚开始一定要清0
    if(l == r){
        tree[i].mn = a[ppp++];
        return ;
    }
    int mid = (l+r)>>1;
    build(l,mid,i<<1);
    build(mid+1,r,i<<1|1);
    pushup(i);
}
void updata(int l,int r,int i,int val){
    if(l <= tree[i].l && r >= tree[i].r){
        tree[i].mn = val;
        tree[i].add = val;
        return ;
    }
    pushdown(i);
    int mid = (tree[i].l+tree[i].r)>>1;
    if(l <= mid){
        updata(l,r,i<<1,val);
    }
    if(r > mid){
        updata(l,r,i<<1|1,val);
    }
    pushup(i);
}
int query(int l,int r,int i){
    if(l <= tree[i].l && r >= tree[i].r){
        return tree[i].mn;
    }
    pushdown(i);
    int mid = (tree[i].l+tree[i].r)>>1;
    int Min = inf;
    if(l <= mid){
        Min = min(query(l,r,i<<1),Min);
    }
    if(r > mid){
        Min = min(query(l,r,i<<1|1),Min);
    }
    return Min;
}
int main(){
    int n,m,q,x,y,z;
    int T;
    cin>>T;
    while(T--){
        ppp=1;
        scanf("%d",&n);
        for(int i=0;i<=n;i++){
            clear(pos[i]);
        }
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            pos[a[i]].push(i);
        }
        for(int i=1;i<=n;i++){
            scanf("%d",&b[i]);
        }
        build(1,n,1);
        int flag=1;
 
        for(int i=1;i<=n&&flag;i++){
                if(pos[b[i]].empty()){
                    flag=0;
                    break;
                }
                int p=pos[b[i]].front();
                pos[b[i]].pop();
                //cout<<b[i]<<' '<<p<<' '<<query(1,p,1)<<endl;
                if(query(1,p,1)==b[i]){
                    a[p]=inf;
                    updata(p,p,1,inf);
                }
                else flag=0;
        }
        if(flag) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}