代码片1

#include <vector>
#include<iostream>


void func(std::vector<int> vec, int &maxCountOn, int &maxCountOff)
{
    /*! preparation */
    size_t length = vec.size();

    size_t curCountOn = 0; /*!< current */
    size_t curCountOff = 0; /*!< current */

    /*! intialize first element */
    size_t previous = vec[0];
    bool countOn;
    if (0 == previous)
    {
        ++curCountOff;
        countOn = false;
    }
    else // previous > 0
    {
        ++curCountOn;
        countOn = true;

    }

    /*! loop starts with the 2nd element */
    for (size_t i = 1; i < length; i++)
    {
        size_t current = vec[i];
        if (countOn)  亮点在这儿。 countOn 可以一直延伸。 可以将中间几段单独剔出来来处理。 因为连续不断，所以可以踢出来单独处理。
        {
            if (current > 0)
            {
                ++curCountOn;
            }
            else // current == 0
            {
                /*! update maxCountOn */
                maxCountOn = maxCountOn < curCountOn ? curCountOn : maxCountOn;
                curCountOn = 0;
                countOn = false;
                curCountOff = 1;
            }
        }
        else // count off
        {
            if (0 == current)
            {
                ++curCountOff;
            }
            else // current > 0
            {
                /*! update maxCountOff */
                maxCountOff = maxCountOff < curCountOff ? curCountOff : maxCountOff;
                curCountOff = 0;
                countOn = true;
                curCountOn = 1;
            }
        }
    }

    /*! update last continuous segment */
    maxCountOn = maxCountOn < curCountOn ? curCountOn : maxCountOn;
    maxCountOff = maxCountOff < curCountOff ? curCountOff : maxCountOff;

}


int main()
{
    int maxCountOn = 0, maxCountOff = 0;

    int Arr[17] ={1, 1, 1, 1, 0, 0, 0, 5, 5, 1, 1, 1, 0, 0, 0, 0, 0};
    std::vector<int> vec;

    for(size_t i = 0; i<17; i++)
    {
        vec.push_back(Arr[i]);
    }

    func(vec,maxCountOn,maxCountOff );

    std::cout<<maxCountOn<<"    "<<maxCountOff<<"   "<<std::endl;
}