传送门
题意
分析
我们去模拟一下这个过程,可以发现,在经过
p
p
p次变换之后,这个序列会变成
a
i
=
g
c
d
(
a
i
,
a
i
+
1
.
.
.
.
.
.
,
a
i
+
p
)
a_i = gcd(a_i,a_{i + 1}......,a_{i + p})
ai=gcd(ai,ai+1......,ai+p)
所以,我们可以去二分一下答案,用线段树维护一下(菜鸡不会
s
t
st
st表)区间
g
c
d
gcd
gcd即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int w[N];
int n;
struct Node{
int l,r;
ll sum,d;
}tr[N * 4];
ll gcd(ll a,ll b){
return b ? gcd(b,a % b) : a;
}
void pushup(Node &u,Node &l,Node &r){
u.sum = l.sum + r.sum;
u.d = gcd(l.d,r.d);
}
void pushup(int u){
pushup(tr[u],tr[u << 1],tr[u << 1 | 1]);
}
void build(int u,int l,int r){
if(l == r){
ll b = w[r] - w[r - 1];
tr[u] = {l,r,b,b};
}
else{
tr[u].l = l,tr[u].r = r;
int mid = l + r >> 1;
build(u << 1,l,mid),build(u << 1 | 1,mid + 1, r);
pushup(u);
}
}
void modify(int u,int x,ll v){
if(tr[u].l == x && tr[u].r == x){
ll b = tr[u].sum + v;
tr[u] = {x,x,b,b};
}
else{
int mid = tr[u].l + tr[u].r >> 1;
if(x <= mid) modify(u << 1,x,v);
else modify(u << 1 | 1,x,v);
pushup(u);
}
}
Node query(int u,int l,int r){
if(tr[u].l >= l && tr[u].r <= r) return tr[u];
else{
int mid = tr[u].l + tr[u].r >> 1;
if(r <= mid) return query(u << 1,l,r);
else if(l > mid) return query(u << 1 | 1,l,r);
else{
auto left = query(u << 1,l,r);
auto right = query(u << 1 | 1,l,r);
Node res;
pushup(res,left,right);
return res;
}
}
}
ll query_gcd(int l,int r){
auto left = query(1, 1, l);
Node right({0, 0, 0, 0});
if (l + 1 <= r) right = query(1, l + 1, r);
return abs(gcd(left.sum,right.d));
}
bool check(int x){
int res = query_gcd(1,1 + x);
for(int i = 2;i <= n / 2;i++){
if(query_gcd(i,i + x) != res) return false;
}
return true;
}
int main() {
int T;
read(T);
while(T--){
read(n);
for(int i = 1;i <= n;i++) read(w[i]),w[i + n] = w[i];
n *= 2;
build(1,1,n);
int l = 0,r = INF;
while(l < r){
int mid = l + r >> 1;
if(check(mid))r = mid;
else l = mid + 1;
}
di(l);
}
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/