Codeforces Round #365 (Div. 2) Mishka and Interesting sum 树状数组

树状数组把区间按右边界排序，然后扫一遍区间处理一下把每个区间的各个出现的值只加一次更新一下树状数组因为要让奇变偶偶变奇

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<stack>
#define LL long long
#define maxn 1000005
using namespace std;
map<int,int>mp;
int n,w,v,u,a[maxn],sum[maxn],ans[maxn],m,pre[maxn],ha[maxn];
struct node{
    int l,r,id;
}no[maxn];
bool cmp(node no1,node no2)
{
     return  no1.r<no2.r;
}
int getSum(int x)
{
    int ans = 0;
    for(;x;x-=(x&(-x)))ans^=sum[x];
    return ans;
}
void update(int x,int flag)
{
     for(;x<=maxn;x+=(x&(-x)))sum[x]^=flag;
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++){scanf("%d",&a[i]);ans[i] = ans[i-1]^a[i];pre[i] = mp[a[i]];mp[a[i]] = i;}
    scanf("%d",&m);
    for(int i=1;i<=m;i++) scanf("%d%d",&no[i].l,&no[i].r),no[i].id = i;
    sort(no+1,no+m+1,cmp);
    for(int cnt = 1,i=1;i<=m;i++)
        {
         for(;cnt<=n&&cnt<=no[i].r;cnt++)
         {
            if(pre[cnt])update(pre[cnt],a[cnt]);
            update(cnt,a[cnt]);
         }
          ha[no[i].id] =  ans[no[i].r]^ans[no[i].l-1]^getSum(no[i].r)^getSum(no[i].l-1);
        }
    for(int i=1;i<=m;i++)printf("%d\n",ha[i]);
    return 0;
}