-
Notifications
You must be signed in to change notification settings - Fork 0
/
LCM.cpp
103 lines (99 loc) · 2.3 KB
/
LCM.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
/* Ankit Srivastava */
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define FF first
#define SS second
#define s(n) scanf("%d",&n)
#define sl(n) scanf("%lld",&n)
#define sf(n) scanf("%lf",&n)
#define ss(n) scanf("%s",n)
#define sc(n) {char temp[4]; ss(temp); n=temp[0];}
#define INF (int)1e9
#define LINF (long long)1e18
#define EPS 1e-9
#define maX(a,b) ((a)>(b)?(a):(b))
#define miN(a,b) ((a)<(b)?(a):(b))
#define abS(x) ((x)<0?-(x):(x))
typedef long long ll;
typedef unsigned long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,PII> TRI;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<ll> vl;
typedef vector<PII> VII;
typedef vector<TRI> VT;
int n;
int TEST_NO;
int a[100005];
vector<int> pre[1000006];
int pr = 0;
void precompute() {
for (int i = 2; i < 1000006; ++i) {
if(pre[i].size() == 0) {
for (int j = i; j < 1000006; j += i) {
pre[j].push_back(pr);
}
pr++;
}
}
}
void read() {
s(n);
for (int i = 0; i < n; ++i) {
s(a[i]);
}
}
void preprocess() {
}
void solve() {
int i = 0, j = -1;
int frq[pr];
memset(frq, 0, sizeof frq);
int ans = 0;
while(i < n and j + 1< n) {
j = j + 1;
int f = 0;
do{
int num = a[j];
f = 0;
for (std::vector<int>::iterator iterator = pre[num].begin(); iterator != pre[num].end(); ++iterator) {
if(frq[*iterator] > 0) f = 1;
}
if(f == 1) {
ans = max(ans, j - i);
num = a[i];
for (std::vector<int>::iterator iterator = pre[num].begin(); iterator != pre[num].end(); ++iterator) {
frq[*iterator] --;
}
i++;
} else {
for (std::vector<int>::iterator iterator = pre[num].begin(); iterator != pre[num].end(); ++iterator) {
frq[*iterator] ++;
}
}
}
while(f == 1);
}
ans = max(ans, j - i + 1);
if(ans == 1) {
puts("-1");
return;
}
printf("%d\n", ans);
}
int main() {
precompute();
int t;
s(t);
for(TEST_NO = 1; TEST_NO <= t; TEST_NO ++) {
read();
preprocess();
solve();
}
return 0;
}