多校#4

#include<cstdio>
#include<cstring>
#include<iostream>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1000010;
ll a[maxn];
int n;

int AP()
{
    int ret = 2;

    int t1, t2, t3, s;
    s = t1 = 0;
    t2 = 1;
    t3 = 2;
    while(1)
    {
        while(t3 < n && a[t3]-a[t2] == a[t2]-a[t1])
        {
            t1++, t2++, t3++;
        }
        if(t3 >= n)
        {
            ret = max(ret, t3-s);
            break;
        }
        ret = max(ret, t3-s);
        s = t2;
        t1++; t2++; t3++;
    }
    return ret;
}

int GP() //这里直接复制AP()改一点条件即可
{
    int ret = 2;
    int t1, t2, t3, s;
    s = t1 = 0;
    t2 = 1;
    t3 = 2;
    while(1)
    {
        //cout << a[t2] << " " << a[t3] << " " << a[t1] << endl;
        while(t3 < n && a[t2]*a[t2] == a[t3]*a[t1])
        {
            t1++, t2++, t3++;
        }
        if(t3 >= n)
        {
            ret = max(ret, t3-s);
            break;
        }
        ret = max(ret, t3-s);
        s = t2;
        t1++; t2++; t3++;
    }
    return ret;
}

int main()
{
    int T; scanf("%d", &T);
    while(T--)
    {
        scanf("%d", &n);
        for(int i = 0; i < n; i++) scanf("%lld", &a[i]);
        if(n == 1 || n == 2)
        {
            cout << n << endl;
            continue;
        }
        int ap, gp;
        ap = AP();
        gp = GP();
        cout << max(ap, gp) << endl;
    }

    return 0;

}