Codeforces Round #724 (Div. 2) D. Omkar and Medians--树状树组

Codeforces Round #724 (Div. 2) D. Omkar and Medians

#include<bits/stdc++.h>
using namespace std;
template <typename T> void debug(string s, T x) { cout << s << "=" << x << "\n"; }
typedef long long ll;
const ll N = 2e5 + 5;
const ll maxv = N;//区间最大值
ll Binary_Indexed_Tree[N];//树状数组
ll lowbit(ll x) {//数状数组lowbit()
    return x & -x;
}
void update(ll index, ll val) {//在index位置加上val
    while (index <= maxv) {
        Binary_Indexed_Tree[index] += val;
        index += lowbit(index);
    }
}
ll sum(ll index) {//求Binary_Indexed_Tree[1 , index]的和
    ll ans = 0;
    while (index) {
        ans += Binary_Indexed_Tree[index];
        index -= lowbit(index);
    }
    return ans;
}

int trans[N],a[N];
int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        memset(Binary_Indexed_Tree,0,sizeof(Binary_Indexed_Tree));
        /*离散化*/
        //因为存在负值所以离散化到1...x的区间
        for(int i=0;i<n;i++){
            cin>>a[i];
            trans[i]=a[i];
        }
        sort(a,a+n);
        int pos=unique(a,a+n)-a;
        for(int i=0;i<n;i++){
            trans[i]=lower_bound(a,a+pos,trans[i])-a;
            ++trans[i];
        }
        for(int i=n-1;~i;i--)trans[i+1]=trans[i];
        trans[0]=1;
        /*查询*/
        //如果两数之间(a,b)有任意一个数的存在则不行
        bool flag=true;
        int temp=0;
        for(int i=1;i<=n;i++){
            temp=sum(max(trans[i-1],trans[i])-1)-sum(min(trans[i-1],trans[i]));
            if(temp>0)flag=false;
            update(trans[i],1);
        }
        if(flag)cout<<"YES\n";
        else cout<<"No\n";
    }
    return 0;
}