Integers Have Friends（线段树，双指针，GCD）

链接

British mathematician John Littlewood once said about Indian mathematician Srinivasa Ramanujan that “every positive integer was one of his personal friends.”

It turns out that positive integers can also be friends with each other! You are given an array a of distinct positive integers.

Define a subarray $a_i,a_{i+1},\dots ,a_j$ to be a friend group if and only if there exists an integer $m\ge 2$ such that $a_i\text{mod}m=a_{i+1}\text{mod}m=\dots =a_j\text{mod}m$, where $x\text{mod}y$ denotes the remainder when $x$ is divided by $y$.

Your friend Gregor wants to know the size of the largest friend group in a.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t(1\le t\le 2\cdot 10^4)$.

Each test case begins with a line containing the integer $n(1\le n\le 2\cdot 10^5)$, the size of the array a.

The next line contains n positive integers $a_1,a_2,\dots ,a_n(1\le a_i\le 10^{18})$, representing the contents of the array a. It is guaranteed that all the numbers in a are distinct.

It is guaranteed that the sum of $n$ over all test cases is less than $2\cdot 10^5$.

Output

Your output should consist of t lines. Each line should consist of a single integer, the size of the largest friend group in a.

Example

input

4
5
1 5 2 4 6
4
8 2 5 10
2
1000 2000
8
465 55 3 54 234 12 45 78

output

3
3
2
6

Note

In the first test case, the array is $[1,5,2,4,6]$. The largest friend group is $[2,4,6]$, since all those numbers are congruent to $0$ modulo $2$, so $m=2$.

In the second test case, the array is $[8,2,5,10]$. The largest friend group is $[8,2,5]$, since all those numbers are congruent to $2$ modulo $3$, so $m=3$.

In the third case, the largest friend group is $[1000,2000]$. There are clearly many possible values of $m$ that work.

思路

显然题意可以转换为，求一个最大的 $len$ ，使得差分数组存在一个长度为 $len$ 的连续子序列，该子序列的 $gcd>1$。

设两个指针 $l，r$，它们确定一个区间 $[l,r]$ 。若该区间 $gcd>1$，那么 $r++$ ；否则 $l++$。这样 $O(n)$ 扫描一遍，不断更新最值就可以了。

查询 $[l,r]$ 的 $gcd$ 可以用线段树或者 $ST$ 表。

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+10;
int T,n,a[N],b[N];
struct segment{ int l,r,gcd; }tree[N<<2];

void build(int p,int l,int r){
	tree[p].l=l,tree[p].r=r;
	if(l==r){ tree[p].gcd=b[l]; return; }
	int mid=(l+r)>>1;
	build(p<<1,l,mid),build(p<<1|1,mid+1,r);
	tree[p].gcd=__gcd(tree[p<<1].gcd,tree[p<<1|1].gcd);
}

int ask(int p,int l,int r){
	if(l<=tree[p].l&&r>=tree[p].r) return tree[p].gcd;
	int mid=(tree[p].l+tree[p].r)>>1;
	int ret=0;
	if(l<=mid) ret=__gcd(ret,ask(p<<1,l,r));
	if(mid+1<=r) ret=__gcd(ret,ask(p<<1|1,l,r));
	return ret;
}

void solve(){
	cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=1;i<n;i++) b[i]=abs(a[i]-a[i-1]);
	if(n==1) return (void)(cout<<"1\n");
	build(1,1,n-1);
	int mx=0;
	for(int l=1,r=1;r<n;r++){
		if(ask(1,l,r)>1) mx=max(mx,r-l+1);
		else while(ask(1,l,r)==1) l++;
	}
	cout<<mx+1<<"\n";
}

signed main(){
	ios::sync_with_stdio(false);
	for(cin>>T;T;T--) solve();
}

方法二

这样暴力居然也能过。

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+10;
int T,n,a[N],b[N];

void solve(){
	cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=1;i<n;i++) b[i]=abs(a[i]-a[i-1]);
	int gcd=0,len=0,mx=0;
	for(int i=1;i<n;i++){
		gcd=__gcd(gcd,b[i]);
		if(gcd==1){
			gcd=len=0;
			for(int j=i;j>=1;j--){
				int t=__gcd(gcd,b[j]);
				if(t>1) gcd=t,len++,mx=max(len,mx);
				else break;
			}
		}else len++,mx=max(len,mx);
	}
	cout<<mx+1<<"\n";
}

signed main(){
	ios::sync_with_stdio(false);
	for(cin>>T;T;T--) solve();
}