hdu 3333 离线线段树 + 思维/树状数组 /在线主席树

#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<cstring>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn =  + ;
ll a[ + ];

struct tree
{
    ll l , r;
    ll val;
}t[maxn << ];

void push_up(ll rt){
    //if(t[rt << 1].val != t[rt << 1|1].val)
    t[rt].val = t[rt << ].val + t[rt << |].val;
    //else
      //  t[rt].val += t[rt << 1].val ;
}

void build(ll rt,ll l ,ll r){
    t[rt].l = l;
    t[rt].r = r;
    t[rt].val = ;
    if(l == r){
        //t[rt].val = a[l];
        return;
    }
    ll mid = (l + r) >> ;
    build(rt << , l , mid);
    build(rt << |,mid+,r);
    push_up(rt);
}

void updata(ll rt,ll x,ll v){
    if(x == t[rt].l && t[rt].r == x){
        t[rt].val += v;
        return;
    }
    ll mid = (t[rt].l + t[rt].r) >> ;
    if(x <= mid) updata(rt <<  , x , v);
    else updata(rt << |, x , v);
    push_up(rt);
}

ll query(ll rt,ll l,ll r){
     if(l <= t[rt].l && r >= t[rt].r) return t[rt].val;
    ll ret  = ;
    ll mid = (t[rt].l + t[rt].r) >> ;
    // if(r <= mid) return query(rt << 1, l, r);
    // else if(l > mid) return query(rt << 1|1,l,r);
    // else return query(rt << 1,l,mid) + query(rt << 1|1,mid + 1,r);
    if (l <= mid) ret += query(rt <<  , l ,r);
    if( r > mid) ret += query(rt << |,l,r);
    push_up(rt);
    return ret;
}

struct node
{
    ll x,y,id;
}nod[ + ];
map<ll,ll> mp;
bool cmp(node s1 ,node s2){
     //if(s1.y == s2.y)
      //   return s1.x < s2.x;
    return s1.y < s2.y;

}
ll ans[ + ];
int main(int argc, char const *argv[])
{
    ll tt;
    scanf("%lld",&tt);
    while(tt--){
        ll n;
        memset(a,,sizeof a);
        memset(t,,sizeof t);
        memset(ans,,sizeof ans);
        mp.clear();
        memset(nod,,sizeof nod);
        scanf("%lld",&n);
        for(ll i = ;i <= n ; i++){
            scanf("%lld",&a[i]);
        }
        build(,,n);
        ll q;
        scanf("%lld",&q);
        for(ll i = ;i <= q; i++){
            ll a,b;
            scanf("%lld%d",&a,&b);
        //printf("%lld\n",query(1,a,b));
            nod[i].x = a,nod[i].y = b,nod[i].id = i;
        }
        ll i = ;
        sort(nod + ,nod + q + ,cmp);

        for(ll j = ; j <= q;j ++){
        for( ;i <= nod[j].y ; i++){
            if(mp[a[i]])
            //mp[a[i]] = 1;

            updata(,mp[a[i]],-a[i]);
           // mp[a[i]] =
           //cout << 1 ;
            mp[a[i]] = i;
            updata(,i,a[i]);
        }
       // cout << 3 << endl ;
     //   cout << nod[j].id << " " << nod[j].x << " " << nod[j].y <<endl;
        ans[nod[j].id] = query(,nod[j].x,nod[j].y);
       // cout << 1 << endl;
    }
   // cout << 1 ;
    //cout << q << endl;
    for(ll i = ;i <= q;i ++){
        printf("%lld\n",ans[i] );
    }
    }
    return ;
}

线段树