Integers Have Friends (cf - 1548B)

传送门

题意

给定n个点 求这些点的最长同余子串 且当m＞1的时候 使得子串中所有数字mod m相等

思路

对于同余子串 我们可以通过差分相减得到新数组g[] 从而转换为求新数组中最长连续子序列 使得该序列中的gcd要>1 对于区间查询我们可以用线段树来维护 然后由于是连续子序列可以用双指针优化搜索区间

代码

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 2e5 + 10;

int n;
ll a[N], g[N];

struct Node
{
	int l, r;
	ll m;
}tr[N * 4];

ll gcd(ll a, ll b)
{
	return b ? gcd(b, a % b) : a;
}

void pushup(int u)
{
	tr[u].m = gcd(tr[u << 1].m, tr[u << 1 | 1].m);
}

void build(int u, int l, int r)
{
	if (l == r) tr[u] = {l, r, g[l]};
	else
	{
		tr[u] = {l, r, 0};
		int mid = l + r >> 1;
		build (u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
		pushup(u);
	}
}

ll query(int u, int l, int r)
{
	if (tr[u].l >= l && tr[u].r <= r) return tr[u].m;
	else
	{
		int mid = tr[u].l + tr[u].r >> 1;
		ll ans = 0;
		if (l <= mid) ans = query(u << 1, l, r);
		if (r > mid)
		{
			ll tmp = query(u << 1 | 1, l, r);
			ans = gcd(ans, tmp);
		}
		return ans;
	}
}

int main()
{
	cin.tie(0); cout.tie(0);
	ios::sync_with_stdio(false);
	
	int T;
	cin >> T;
	
	while (T -- )
	{
		cin >> n;
		
		for (int i = 0; i < n; i ++ ) cin >> a[i];
		
		if (n == 1)
		{
			cout << 1 << endl;;
			continue;
		}

		for (int i = 1; i < n; i ++ ) g[i] = abs(a[i] - a[i - 1]);
		
		build(1, 1, n - 1);
		
		int ans = 1;
		for (int l = 1, r = 1; r < n; r ++ )
		{
			if (g[r] == 1) continue;
			while (l < r && query(1, l, r) == 1) l ++ ;
			ans = max(ans, r - l + 2);
		}
		
		cout << ans << endl;
	}
	
	return 0;
}