hdu 3333 Turing Tree 求区间内不同数的和——线段树解法

http://acm.hdu.edu.cn/showproblem.php?pid=3333

题意：求区间内不同数的和

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=30005;
const int maxq=100005;
map<ll,ll>mp;
struct node
{
    ll l,r,id;
};
node q[maxq];
bool cmp(node a,node b)
{
    return a.r<b.r;
}
struct Tree
{
    int left,right,id;
    ll sum;
};
Tree tree[maxn<<2];
void build(int id,int l,int r)
{
    tree[id].left=l;
    tree[id].right=r;
    if(l==r)
    {
        tree[id].sum=0;//区间内不同数字的和
        return;
    }
    int mid=(l+r)/2;
    build(id*2,l,mid);
    build(id*2+1,mid+1,r);
    tree[id].sum=tree[id*2].sum+tree[id*2+1].sum;
}
void update(int id,int pos,ll val)
{
    if(tree[id].left==tree[id].right)
    {
        tree[id].sum+=val;
    }
    else
    {
        int mid=(tree[id].left+tree[id].right)/2;
        if(pos<=mid)
            update(id*2,pos,val);
        else
            update(id*2+1,pos,val);
        tree[id].sum=tree[id*2].sum+tree[id*2+1].sum;
    }
}
ll query(int id,int l,int r)
{
    if(l==tree[id].left&&r==tree[id].right)
    {
        return tree[id].sum;
    }
    else
    {
        int mid=(tree[id].left+tree[id].right)/2;
        if(r<=mid)
            query(id*2,l,r);
        else if(l>mid)
            query(id*2+1,l,r);
        else
            return query(id*2,l,mid)+query(id*2+1,mid+1,r);
    }
}
ll a[maxn],ans[maxq];
int main()
{
    int t,n,m,i,j,cur;
    scanf("%d",&t);
    while(t--)
    {
        mp.clear();
        scanf("%d",&n);
        //cout<<"!"<<endl;
        build(1,1,n);
        //cout<<"!!"<<endl;
        for(i=1;i<=n;i++)
            scanf("%lld",&a[i]);
        scanf("%d",&m);
        for(i=1;i<=m;i++)
        {
            scanf("%lld%lld",&q[i].l,&q[i].r);
            q[i].id=i;
        }
        sort(q+1,q+m+1,cmp);
        cur=1;//cout<<1<<endl;
        for(i=1;i<=m;i++)
        {
            for(j=cur;j<=q[i].r;j++)
            {
                if(mp.find(a[j])!=mp.end())
                {
                    update(1,mp[a[j]],-a[j]);
                }
                update(1,j,a[j]);
                mp[a[j]]=j;
            }
            cur=q[i].r+1;
            ans[q[i].id]=query(1,q[i].l,q[i].r);
        }
        for(i=1;i<=m;i++)
            printf("%lld\n",ans[i]);
    }
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=30005;
const int maxq=100005;
map<ll,ll>mp;
struct node
{
    ll l,r,id;
};
node q[maxq];
bool cmp(node a,node b)
{
    return a.r<b.r;
}
struct Tree
{
    int left,right,id;
    ll sum;
};
Tree tree[maxn<<2];
void build(int id,int l,int r)
{
    tree[id].left=l;
    tree[id].right=r;
    if(l==r)
    {
        tree[id].sum=0;//区间内不同数字的和
        return;
    }
    int mid=(l+r)/2;
    build(id*2,l,mid);
    build(id*2+1,mid+1,r);
    tree[id].sum=tree[id*2].sum+tree[id*2+1].sum;
}
void update(int id,int pos,ll val)
{
    if(tree[id].left==tree[id].right)
    {
        tree[id].sum=val;
    }
    else
    {
        int mid=(tree[id].left+tree[id].right)/2;
        if(pos<=mid)
            update(id*2,pos,val);
        else
            update(id*2+1,pos,val);
        tree[id].sum=tree[id*2].sum+tree[id*2+1].sum;
    }
}
ll query(int id,int l,int r)
{
    if(l==tree[id].left&&r==tree[id].right)
    {
        return tree[id].sum;
    }
    else
    {
        int mid=(tree[id].left+tree[id].right)/2;
        if(r<=mid)
            query(id*2,l,r);
        else if(l>mid)
            query(id*2+1,l,r);
        else
            return query(id*2,l,mid)+query(id*2+1,mid+1,r);
    }
}
ll a[maxn],ans[maxq];
int main()
{
    int t,n,m,i,j,cur;
    scanf("%d",&t);
    while(t--)
    {
        mp.clear();
        scanf("%d",&n);
        //cout<<"!"<<endl;
        build(1,1,n);
        //cout<<"!!"<<endl;
        for(i=1;i<=n;i++)
            scanf("%lld",&a[i]);
        scanf("%d",&m);
        for(i=1;i<=m;i++)
        {
            scanf("%lld%lld",&q[i].l,&q[i].r);
            q[i].id=i;
        }
        sort(q+1,q+m+1,cmp);
        cur=1;//cout<<1<<endl;
        for(i=1;i<=m;i++)
        {
            for(j=cur;j<=q[i].r;j++)
            {
                if(mp.find(a[j])!=mp.end())
                {
                    update(1,mp[a[j]],0);
                }
                update(1,j,a[j]);
                mp[a[j]]=j;
            }
            cur=q[i].r+1;
            ans[q[i].id]=query(1,q[i].l,q[i].r);
        }
        for(i=1;i<=m;i++)
            printf("%lld\n",ans[i]);
    }
}