gistfile1.txt

int f(const vector<int> &x)
{
    int longest = 2;
    int p = 0;
    int q = 0;
    while (q < x.size())
    {
        int len = q - p + 1;
        if (admissible(x, p, q))
        {
            if (len > longest)
            {
                longest = len;
            }
        }
        else
        {
            p = q;
        }
        q++;
    }
}

bool admissible(const vector<int> &x, int p, int q)
{
    if ((p == q) || (q == p + 1)) { return true; }
    if (x[q - 2] + x[q - 1] == x[q]) { return true ;}
    return false;
}