传送门
考虑到a[l],gcd(a[l],a[l+1]),gcd(a[l],a[l+1],a[l+2])....gcd(a[l]...a[r])a[l],gcd(a[l],a[l+1]),gcd(a[l],a[l+1],a[l+2])....gcd(a[l]...a[r])a[l],gcd(a[l],a[l+1]),gcd(a[l],a[l+1],a[l+2])....gcd(a[l]...a[r])是可以分成最多logloglog段且段内的数都是相同的。
那么我们用链表维护这logloglog块边维护边统计就行了。
代码
转载于:https://www.cnblogs.com/ldxcaicai/p/10084834.html
![[LeetCode] 3. Longest Substring Without Repeating Characters 题解](http://pic.xiahunao.cn/[LeetCode] 3. Longest Substring Without Repeating Characters 题解)
