#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<ctime>
#include "cstdio"
#include "string"
#include "string.h"
#include "map"
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int st[N][30], n, ans1, a[N];
map<int, ll>mp;
int gcd(int a, int b)
{
return (b>0) ? gcd(b, a%b) : a;
}
void init(int *a,int n)
{
for (int i = 1;i <= n;i++)
st[i][0] = a[i];
for (int j = 1; j<18; j++)
for (int i = 1; i + (1 << j) -1 <= n; i++)
st[i][j] = gcd(st[i][j - 1], st[i + (1 << j - 1)][j - 1]);
}
int rmq(int u, int v)
{
int k = 0;
while (u + (1 << k) <= v + 1) k++;
k--;
return gcd(st[u][k], st[v - (1 << k) + 1][k]);
}
ll ans;
int solve(int start,int l,int r,int num)
{
int pos = r + 1;
while (l < r)
{
int mid = (l + r) / 2;
if (rmq(start, mid) < num)
{
r = mid;
pos = r;
}
else
{
l = mid + 1;
pos = l;
}
}
return pos;
}
int main()
{
int T, m, cas = 1;
scanf("%d", &T);
while (T--)
{
scanf("%d", &n);
mp.clear();
memset(a, 0, sizeof(a));
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
init(a,n);
for (int i = 1;i <= n;i++)
{
for (int j = i;j <= n;)
{
int jump = solve(i, j, n, rmq(i, j));
mp[rmq(i, j)] += jump - j;
j = jump;
}
}
printf("Case #%d:\n", cas++);
scanf("%d", &m);
int a, b;
while (m--)
{
scanf("%d%d", &a, &b);
ans1 = rmq(a, b);
ans = mp[ans1];
printf("%d %lld\n", ans1, ans);
}
}
return 0;
}
2016 Multi-University Training Contest 1 1004 GCD
题目链接:点击打开链接
题目大意:给你一串序列,按要求输出l到r的gcd值,并且找出整条序列中所有gcd值等于l到r的gcd值得子序列数量。
解题思路:一开始没想明白gcd是否满足二分性,其实算是满足的,当开始位置定了之后,随着长度增加gcd值不上升。同时这题本身需要预处理,但是其实只有logn中因数,那么枚举开始点,也就只有nlogn的复杂度,用map保存每种结果的值,st表查询区间gcd(线段树会超时)
代码:
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.