【HDU】3074 Multiply game

#include<cstdio>
typedef __int64 LL;
#define MAXN 50010
#define MOD 1000000007
LL tree[MAXN<<2];
inline void PushUp(int rt)
{
    tree[rt]=tree[rt<<1]*tree[rt<<1|1];
    tree[rt]%=MOD;
}
void Build(int L,int R,int rt)
{
    if(L==R)
        scanf("%I64d",&tree[rt]);
    else
    {
        int mid=(L+R)>>1;
        Build(L,mid,rt<<1);
        Build(mid+1,R,rt<<1|1);
        PushUp(rt);
    }
}
void Update(int x,int val,int L,int R,int rt)
{
    if(L==R)
        tree[rt]=val;
    else
    {
        int mid=(L+R)>>1;
        if(mid>=x)
            Update(x,val,L,mid,rt<<1);
        else
            Update(x,val,mid+1,R,rt<<1|1);
        PushUp(rt);
    }
}
LL Query(int x,int y,int L,int R,int rt)
{
    if(x<=L&&R<=y)
        return tree[rt];
    int mid=(L+R)>>1;
    LL ans=1;
    if(mid>=x)
    {
        ans*=Query(x,y,L,mid,rt<<1);
        ans%=MOD;
    }
    if(y>mid)
    {
        ans*=Query(x,y,mid+1,R,rt<<1|1);
        ans%=MOD;
    }
    return ans;
}
int main()
{
    int c,n,q,cmd,x,y;
    scanf("%d",&c);
    while(c--)
    {
        scanf("%d",&n);
        Build(1,n,1);
        scanf("%d",&q);
        while(q--)
        {
            scanf("%d%d%d",&cmd,&x,&y);
            if(cmd)
                Update(x,y,1,n,1);
            else
                printf("%I64d\n",Query(x,y,1,n,1));
        }
    }
    return 0;
}