CF1549 D. Integers Have Friends

$gcd$居然能用$ST$表维护！！！

差分，然后$ST$表维护双指针。

AC代码：

#include <bits/stdc++.h>

using namespace std;

template <class T>
struct RMQ
{
    vector <vector <T>> ST;
    RMQ(const vector <T> & V) : ST(1, V)
    {
        int Len = V.size();
        for (int pw = 1, i = 1; (pw << 1) <= Len; pw <<= 1, ++i)
        {
            ST.emplace_back(Len - (pw << 1) + 1);
            int len = ST[i].size();
            for(int j = 0; j < len; ++j)
                ST[i][j] = __gcd(ST[i - 1][j], ST[i - 1][j + pw]);
        }
    };
    T query(int l, int r)
    {
        if(l == r) return ST[0][l - 1];
        int k = 31 - __builtin_clz(r - l + 1);
		return __gcd(ST[k][l - 1], ST[k][r - (1 << k)]);
    }
};

signed main()
{
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t --)
    {
        int n;
        cin >> n;
        vector <long long> a(n + 5);
        for(int i = 1; i <= n; ++i)
        {
            cin >> a[i];
        }
        vector <long long> b(n - 1);
        for(int i = 2; i <= n; ++i)
        {
            b[i - 2] = abs(a[i] - a[i - 1]);
        }
        RMQ <long long> T(b);
        int l = 1, r = 1, ans = 1;
        while(r < n)
        {
            while(l <= r && T.query(l, r) == 1) l ++;
            ans = max(ans, r - l + 2);
            r++;
        }
        cout << ans << '\n';
    }
}