Multiply game HDU - 3074

Multiply game HDU - 3074

Tired of playing computer games, alpc23 is planning to play a game on numbers. Because plus and subtraction is too easy for this gay, he wants to do some multiplication in a number sequence. After playing it a few times, he has found it is also too boring. So he plan to do a more challenge job: he wants to change several numbers in this sequence and also work out the multiplication of all the number in a subsequence of the whole sequence.
To be a friend of this gay, you have been invented by him to play this interesting game with him. Of course, you need to work out the answers faster than him to get a free lunch, He he…

Input

The first line is the number of case T (T<=10).For each test case, the first line is the length of sequence n (n<=50000), the second line has n numbers, they are the initial n numbers of the sequence a1,a2, …,an, Then the third line is the number of operation q (q<=50000), from the fourth line to the q+3 line are the description of the q operations. They are the one of the two forms: 0 k1 k2; you need to work out the multiplication of the subsequence from k1 to k2, inclusive. (1<=k1<=k2<=n)
1 k p; the kth number of the sequence has been change to p. (1<=k<=n) You can assume that all the numbers before and after the replacement are no larger than 1 million.

Output

For each of the first operation, you need to output the answer of multiplication in each line, because the answer can be very large, so can only output the answer after mod 1000000007.

Sample Input

1
6
1 2 4 5 6 3
3
0 2 5
1 3 7
0 2 5

Sample Output

240
420

一.解题思路及要点分析

1. 题目大意:对于一个非负整数数列进行两种操作
   1. 将一个数改成另一个数
   2. 查询某个区间的所有数的乘积
2. 这是基本的线段树的模板题, 考察单点修改,区间查询
3. 注意在适当的位置进行取模

二.代码

#include<stdio.h>
#include<iostream>
#include<stdlib.h>
#include<string.h>
using namespace std;
const int maxn=50005;
#define mod 1000000007
int T,n,a[maxn],q;
long long  t[maxn<<2];

void build(int k,int l,int r)
{
    if(l==r)
    {
        t[k]=a[l];
        return ;
    }
    int  mid=(l+r)>>1;
    build(k<<1,l,mid);
    build(k<<1|1,mid+1,r);
    t[k]=((t[k<<1]%mod)*(t[k<<1|1]%mod))%mod;
    return ;
}
long long   query(int L,int R,int l,int r,int k)
{
    if(L>=l&&R<=r)return t[k];
    int mid=(L+R)>>1;
    long long  ans=1;
    //区间查询基本操作
    if(l<=mid) ans=(ans*query(L,mid,l,r,k<<1))%mod;
    if(r>mid) ans=(ans*query(mid+1,R,l,r,k<<1|1))%mod;
    return ans%mod;
}
void upd(int k,int L,int R,int ind,int p)
{
    if(L==R)
    {
        t[ind]=(long long)p;//注意细节
        return ;
    }
    int mid=(L+R)>>1;
    if(k>mid)upd(k,mid+1,R,ind<<1|1,p);
    else upd(k,L,mid,ind<<1,p);
    //注意此处不是k而是ind,一定要区分每个函数的形参的实际含义,不同函数可能不一样
    t[ind]=((t[ind<<1]%mod)*(t[ind<<1|1]%mod))%mod;
    return ;
}
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        memset(t,0,sizeof(t));
        memset(a,0,sizeof(a));
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        build(1,1,n);
        scanf("%d",&q);
        int opt,k1,k2,k,p;
        while(q--)
        {
            scanf("%d",&opt);
            if(opt==0)
            {
                scanf("%d%d",&k1,&k2);
                printf("%lld\n",query(1,n,k1,k2,1));
            }
            else
            {
                scanf("%d%d",&k,&p);
                upd(k,1,n,1,p);
            }
        }
    }
}