HDU5726 （线段树+暴力）

题目链接
第一问是没有修改的线段树，第二问暴力预处理，因为gcd的结果不会很多

#include<bits/stdc++.h>
using namespace std;
#define cl(a,b) memset(a,b,sizeof(a))
#define LL long long
#define pb push_back
#define gcd __gcd

const int maxn = 1e5+200;
const int inf  = 1 << 23;

int n;LL a[maxn];
LL node[maxn*4];

void push_up(int rt){
    node[rt] = gcd(node[rt<<1],node[rt<<1|1]);
}

void build(int rt,int l,int r){
    if(l==r){
        node[rt]=a[l];
        return ;
    }
    int mid = l+r>>1;
    build(rt<<1, l, mid);
    build(rt<<1|1, mid+1, r);
    push_up(rt);
}

LL query(int rt,int l,int r,int x,int y){
    //printf("rt = %d, l = %d, r = %d, x = %d,y = %d\n",rt,l,r,x,y);
    if(x<=l&&y>=r){
        return node[rt];
    }
    int mid = l+r>>1;
    LL lson=0 ,rson=0;

    if(x<=mid) lson = query(rt<<1,l,mid,x,y);
    if(y>mid)  rson = query(rt<<1|1,mid+1,r,x,y);
    if(lson==0)return rson;
    if(rson==0)return lson;
    return gcd(lson,rson);
}

map<LL,LL> f[maxn];//f[i]记录下第a[i]形成的gcd的集合
map<LL,LL> ans;

int main(){
    int T;scanf("%d",&T);
    int cas = 1;
    while(T--){
        printf("Case #%d:\n",cas++);
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }

        build(1,1,n);
        ans.clear();
        for(int i=0;i<=n;i++)f[i].clear();

        ans[a[1]]=1;f[1][a[1]]=1;
        for(int i=2;i<=n;i++){
            ans[a[i]]++;f[i][a[i]]+=1;
            for(map<LL,LL>::iterator it = f[i-1].begin();it!=f[i-1].end();it++){
                LL tmp = gcd(a[i],it->first);
                f[i][tmp]+=it->second;
                ans[tmp]+=it->second;
            }
        }

        int q;scanf("%d",&q);
        while(q--){
            int x,y;scanf("%d%d",&x,&y);
            LL _gcd = query(1,1,n,x,y);
            printf("%lld %lld\n",_gcd,ans[_gcd]);
        }
    }
    return 0;
}