<span style="font-family:Microsoft YaHei;font-size:18px;">#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<utility>
using namespace std;
#define lson left,m,root<<1
#define rson m+1,right,root<<1|1
const int maxn = 100005;
typedef pair<int ,int> pii;
pii b[maxn<<2];
int gcd[maxn<<2],cnt = 1;
int PushUp(int root) {
gcd[root] = __gcd(gcd[root<<1],gcd[root<<1|1]);
}
void build(int left,int right,int root) {
if(left == right) {
scanf("%d",&gcd[root]);
b[cnt].first = gcd[root];
b[cnt].second = cnt;
cnt++;
return;
}
int m = (left+right) >> 1;
build(lson);
build(rson);
PushUp(root);
}
int query(int L,int R,int left,int right,int root) {
if(L <= left && right <= R) {
return gcd[root];
}
int m = (left+right) >> 1;
int a,b,ff = 0,f = 0;
if(m >= L) {
a = query(L,R,lson);
f = 1;
}
if(R > m) {
b = query(L,R,rson);
ff = 1;
}
if(ff == 1 && f == 1)
return __gcd(a,b);
else if(f == 1)
return a;
else if(ff == 1)
return b;
else
return 0;
}
int check(int L,int R,int ans,int left,int right,int root) {
if(gcd[root] > ans)
return 0;
if(left == right) {
if(gcd[root] == ans)
return 1;
else
return 0;
}
int m = (left+right) >> 1;
int sum = 0;
if(m >= L) sum += check(L,R,ans,lson);
if(R > m) sum += check(L,R,ans,rson);
return sum;
}
int main() {
int n,t,l,r;
scanf("%d",&n);
build(1,n,1);
sort(b+1,b+1+n);
scanf("%d",&t);
for(int i = 0;i < t;i++) {
scanf("%d%d",&l,&r);
int ans = query(l,r,1,n,1);
int ll = lower_bound(b+1,b+1+n,pii(ans,l)) - (b+1);
int rr = lower_bound(b+1,b+1+n,pii(ans,r+1)) - (b+1);
printf("%d\n",r-l+1-(rr-ll));
}
}</span>
关于如何在区间内快速查找某个数:
头文件 #include<utility>
使用pair容器,std::pair主要的作用是将两个数据组合成一个数据,两个数据可以是同一类型或者不同类型。例如std::pair 或者 std::pair等。pair实质上是一个结构体,其主要的两个成员变量是first和second,这两个变量可以直接使用。
模板 :
typedef pair<int, int> pii;
pii b[10086];
int main() {
int n;
while(~scanf("%d", &n)) {
for(int i = 1; i <= n; i++) {
scanf("%d", &b[i].first);
b[i].second = i;
}
sort(b + 1, b + 1 + n);
int l, r;
int m; scanf("%d %d %d", &m, &l, &r); //要查询的数和区间
int ll = lower_bound(b + 1, b + 1 + n, pii(m, l)) - (b + 1);
int rr = lower_bound(b + 1, b + 1 + n, pii(m, r + 1)) - (b + 1);
printf("%d\n", rr - ll);
}
}