You have array a1, a2, ..., an. Segment [l, r] (1 ≤ l ≤ r ≤ n) is good if ai = ai - 1 + ai - 2, for all i(l + 2 ≤ i ≤ r).
Let's define len([l, r]) = r - l + 1, len([l, r]) is the length of the segment [l, r]. Segment [l1, r1], is longer than segment [l2, r2], if len([l1, r1]) > len([l2, r2]).
Your task is to find a good segment of the maximum length in array a. Note that a segment of length 1 or 2 is always good.
Input
The first line contains a single integer n (1 ≤ n ≤ 105) — the number of elements in the array. The second line contains integers: a1, a2, ..., an (0 ≤ ai ≤ 109).
Output
Print the length of the longest good segment in array a.
Sample Input
10
1 2 3 5 8 13 21 34 55 89
10
5
1 1 1 1 1
2
找满足斐波那契数列的连续子序列最长长度
<span style="font-size:18px;">#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> using namespace std; struct node { long long a,b; }; node a[100005]; int main() { int i,n,t,ans; while(~scanf("%d",&n)) { for(i=0; i<n; i++) { scanf("%I64d",&a[i].a); a[i].b=0; } for(i=2; i<n; i++) if(a[i].a==a[i-1].a+a[i-2].a) a[i].b=1; t=0,ans=0; for(i=0; i<n; i++) { if(a[i].b==1) t++; else t=0; if(t>ans) ans=t; } if(n<3) printf("%d\n",n); else printf("%d\n",ans+2); } return 0; } </span>