找水王

#include <iostream>

using namespace std;

void main()

{

    int n,i,a[100],m,l;

    cin>>n;

    for(i=0;i<n;i++)

    {

        cin>>a[i];

    }

    int t=0;

    int q=a[0];

    int p=0;

    for(i=1;i<n;i++)

    {

        if(a[i]==q)

        {

            t++;

            if(t>=p)

            {

                p=t;

                m=a[i];

            }

            q=a[i];

        }

        else

        {

            l=t--;

            if(l<0)

            {

                t=0;

                q=a[i];

            }

            else

            {

                t=l;

                q=a[i];

            }

        }

    }

原文地址:https://www.cnblogs.com/wyppaa/p/13093883.html