gistfile1.txt

    int array[];

    int prev2 = array[0];
    int prev1 = array[1];
    int sum_prev = prev1 + prev2;
    bool seg_good = true;
    for (int i = 2; i < n; ++i)
    {
        int cur = array[i];
        if (cur == sum_prev)
        {
            longest_seg++;
        }
        else
        {
            longest_seg = 2;
        }
        prev2 = prev1;
        prev1 = cur;
        sum_prev = prev1 + prev2;
    }
    cout << longest_seg << endl;
    return 0;