神奇的ｂｕｇ

#include<iostream>
#include<algorithm>
#include <vector>
#include<cstdio>
#include<cstring>
using namespace std;
#define ls o<<1
#define rs o<<1|1
#define lson L,mid,ls
#define rson mid+1,R,rs
#define mdzz int mid=(L+R)>>1;
int N,M;
long long tree[120005];
int s[30005];
int woc[30005];
int vis[30005];
long long ans[100003];
struct node
{
    int l,r,t;
    bool operator <(const node &a)const
    {
        return a.r>r;
    }
}q[200003];
void pushup(int o){
    tree[o]=tree[ls]+tree[rs];
}
void update(int p,int L,int R,int o,int v){ //点修改
    if(L==R){
        tree[o]+=v;
        return;
    }
    mdzz;
    if(p<=mid) update(p,lson,v);
    else update(p,rson,v);
    pushup(o);
}
long long query(int l,int r,int L,int R,int o){//[l,r]区间询问
    if(r>=R&&l<=L) return tree[o];
    mdzz;
    long long ans=0;
    if(l<=mid)
        ans+=query(l,r,lson);
    if(r>mid)
        ans+=query(l,r,rson);
    return ans;
}
vector<int> v;
int getid(int k)
{
    return lower_bound(v.begin(),v.end(),k)-v.begin()+1;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(vis,0,sizeof vis);
        memset(tree,0,sizeof tree);
//        memset(woc,0,sizeof woc);
        scanf("%d",&N);
        for(int i=1;i<=N;i++){scanf("%d",&s[i]);
            v.push_back(s[i]);}
        scanf("%d",&M);
        for(int i=1;i<=M;i++)
        {
            scanf("%d%d",&q[i].l,&q[i].r);
            q[i].t=i;
        }

        sort(v.begin(),v.end());
        v.erase(unique(v.begin(),v.end()),v.end());

        sort(q+1,q+M+1);
        int p=1;
        for(int i=1;i<=M;i++)
        {
            while(p<=q[i].r)
            {
                int temp=getid(s[p]);
                if(vis[temp])
                    update(vis[temp],1,N,1,-s[p]);
                vis[temp]=p;
                update(p,1,N,1,s[p]);
                p++;
            }
            ans[q[i].t]=query(q[i].l,q[i].r,1,N,1);
        }
        for(int i=1;i<=M;i++)printf("%lld\n",ans[i]);

    }
    return 0;
}

帮我找ｂｕｇ啊。这两个代码我都快写成一样的了。为什么下面的不能Ａ啊ｗｏｃ

#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))

typedef long long ll;

const int maxn=1e6+5;
int a[maxn];
ll tree[maxn];
ll  ansn[maxn];
int vis[maxn];
struct Node{
    int l,r,ro;
    bool operator <(const Node &a)const
    {
        return a.r>r;
    }
}ques[maxn];
vector<int> v;
#define lson ro<<1, l, m
#define rson ro<<1|1,  m+1, r
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(ch<'0'||ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while(ch>='0'&&ch<='9') { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); }
    return x*f;
}

int getid(int k)
{
    return lower_bound(v.begin(),v.end(),k)-v.begin()+1;
}

void pushup(int ro){
    tree[ro]=tree[ro<<1]+tree[ro<<1|1];
}

void update(int ro,int l,int r,int index,int val){
    if(l==r){
        tree[ro]+=val;
        return ;
    }
    int m=l+r>>1;
    if(index<=m){
        update(lson,index,val);
    }
    else{
        update(rson,index,val);
    }
    pushup(ro);
}

ll query(int ro,int l,int r,int rl,int rr){
    if(l<=rl&&rr<=r) return tree[ro];
    int m=l+r>>1;
    ll ans=0;
    if(rl<=m){
        ans+=query(lson,rl,rr);
    }
    if(rr>m){
        ans+=query(rson,rl,rr);
    }
    return ans;
}

int main()
{

    int c;scanf("%d",&c);
    while(c--){
        mem(vis,0);
        mem(tree,0);
        int n;scanf("%d",&n);
        for(int i=1;i<=n;i++){scanf("%d",&a[i]);
            v.push_back(a[i]);}
        int q;scanf("%d",&q);
        for(int i=1;i<=q;i++){
            scanf("%d%d",&ques[i].l,&ques[i].r);
            ques[i].ro=i;
        }
        sort(v.begin(),v.end());
        v.erase(unique(v.begin(),v.end()),v.end());
        sort(ques+1,ques+1+q);
        int iter=1;
        for(int i=1;i<=q;i++)
        {
            while(iter<=ques[i].r) {
                int zhan = getid(a[iter]);
                if (vis[zhan])update(1, 1, n, vis[zhan], -a[iter]);
                vis[zhan] = iter;
                update(1, 1, n, iter, a[iter]);
                iter++;
            }
            ansn[ques[i].ro] = query(1, 1, n, ques[i].l, ques[i].r);
        }
        for(int i=1;i<=q;i++)printf("%lld\n",ansn[i]);
    }
}