HDU5726 GCD

 http://acm.hdu.edu.cn/showproblem.php?pid=5726

思路：1直接线段树gcd，2，dp每次添加a[i]，后gcd数量更新；

#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------


const int maxn=1e5+9;
const int mod=1e9+7;

struct node
{
    ll gd;
}tree[maxn*4];
ll a[maxn];
void pushup(int rt)
{
    tree[rt].gd=__gcd(tree[rt<<1].gd,tree[rt<<1|1].gd);
}

void build(int rt,int l,int r)
{
    tree[rt].gd=0;
    if(l==r)
    {
        tree[rt].gd=abs(a[l]);
        return ;
    }
    int mid=(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    pushup(rt);
}

ll query_gcd(int rt,int l,int r,int ql,int qr)
{
    if(ql<=l&&qr>=r)
    {
        return tree[rt].gd;
    }
    int mid=(l+r)>>1;
    /*if(qr<=mid)return query_gcd(rt<<1,l,mid,ql,qr);
    if(ql>mid) return query_gcd(rt<<1|1,mid+1,r,ql,qr);
    else
    {
        return __gcd(query_gcd(rt<<1,l,mid,ql,mid),query_gcd(rt<<1|1,mid+1,r,mid+1,qr));
    }*/
    int tmp1=0;
    int tmp2=0;
    if(ql<=mid) tmp1=query_gcd(rt<<1,l,mid,ql,qr);
    if(qr>mid) tmp2=query_gcd(rt<<1|1,mid+1,r,ql,qr);
    if(tmp1==0) return tmp2;
    if(tmp2==0) return tmp1;
    return __gcd(tmp1,tmp2);

}
map<ll,ll> dp[maxn];
map<ll,ll> mp;
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int T;
    T=read();
    int cas=0;
    while(T--)
    {
        int n,m;
        //cin>>n>>m;
        n=read();
        dp[0].clear();
        for(int i=1;i<=n;i++)
        {
            //cin>>a[i];
            a[i]=read();
            dp[i].clear();
        }
        mp.clear();
        build(1,1,n);
        dp[1][a[1]]=1;
        mp[a[1]]=1;
        for(int i=2;i<=n;i++)
        {
            mp[a[i]]++;
            dp[i][a[i]]+=1;
            for(map<ll,ll>::iterator it=dp[i-1].begin();it!=dp[i-1].end();it++)
            {
                ll tmp=__gcd(a[i],it->first);
                dp[i][tmp]+=it->second;
                mp[tmp]+=it->second;
            }
        }
        printf("Case #%d:\n",++cas);
        m=read();
        while(m--)
        {
            int l,r;
            l=read();
            r=read();
            ll ans=query_gcd(1,1,n,l,r);
            printf("%lld %lld\n",ans,mp[ans]);
        }
    }


    return 0;
}