题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=5869
题目大意:长度n的序列, m个询问区间[L, R], 问区间内的所有子段(要求连续的子序列)的不同GCD值有多少种.
解题思路:离线+树状数组。固定R,边预处理L边记录答案。
/* ***********************************************
┆ ┏┓ ┏┓ ┆
┆┏┛┻━━━┛┻┓ ┆
┆┃ ┃ ┆
┆┃ ━ ┃ ┆
┆┃ ┳┛ ┗┳ ┃ ┆
┆┃ ┃ ┆
┆┃ ┻ ┃ ┆
┆┗━┓ 马 ┏━┛ ┆
┆ ┃ 勒 ┃ ┆
┆ ┃ 戈 ┗━━━┓ ┆
┆ ┃ 壁 ┣┓┆
┆ ┃ 的草泥马 ┏┛┆
┆ ┗┓┓┏━┳┓┏┛ ┆
┆ ┃┫┫ ┃┫┫ ┆
┆ ┗┻┛ ┗┻┛ ┆
************************************************ */
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <bitset>
using namespace std;
#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType int
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
#define mem(x,v) memset(x,v,sizeof(x))
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}
const int N = 1e6 + 7;
int a[N],c[N],ans[N],pre[N];
int n,q;
int lowbit(int x) { return x & -x; }
void update(int i,int val)
{
while(i<=n)
{
c[i] += val;
i += lowbit(i);
}
}
int getsum(int i)
{
int res = 0;
while(i)
{
res += c[i];
i -= lowbit(i);
}
return res;
}
int query(int L,int R)
{
return getsum(R) - getsum(L-1);
}
struct node
{
int l,id;
};
vector<node>p[N];
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
//ios::sync_with_stdio(0);
//cin.tie(0);
while(~scanf("%d%d",&n,&q))
{
MS0(c);
MS0(pre);
for(int i=1;i<=n;i++) a[i] = read(), p[i].clear();
for(int i=1;i<=q;i++)
{
int l = read(), r = read();
p[r].pb(node{l,i});
}
for(int i=1;i<=n;i++)
{
for(int j=i,x=a[j];j>0;j--,x=Gcd(x,a[j]))
{
if(j>pre[x])
{
if(pre[x]!=0) update(pre[x],-1);
update(j,1);
pre[x] = j;
}
if(x==1) break;
}
for(int j=0;j<p[i].size();j++)
ans[p[i][j].id] = query(p[i][j].l,i);
}
for(int i=1;i<=q;i++)
printf("%d\n",ans[i]);
}
return 0;
}