找水王

#include<iostream>
using namespace std;

int FindWaterKing(int IDNum[],int m,int &waterking)
{

   int count=0,count1=0;            //计数,相同帖子ID数目,水王
   for(int i=0;i<m;i++)
   {
       if(count==0)                //计数等于0
       {
           waterking=IDNum[i];                   //当前的ID为水王
           count++;                                //计数加1
           count1=0;
           count1++;
       }
       else                                  //计数不等于0
       {
           if(waterking==IDNum[i])             //当前ID等于水王
           {
               count++;                     //计数加1
               count1++;
           }
           else
               count--;                     //计数减1
       }   
   }
   return count1;
}

int main(){
  int IDNum[100];                   //存放帖子ID
  int n,waterking,num;                             //帖子数量,水王,相同帖子数目
  cout<<"请输入帖子数量："<<endl;
  cin>>n;
  cout<<"请输入帖子ID："<<endl;
  for(int i=0;i<n;i++)
  {
      cin>>IDNum[i];
  }
  num=FindWaterKing(IDNum,n,waterking);
 if(num>(n/2))
    cout<<"水王是："<<waterking<<endl;
 else
    cout<<"没有水王！！！"<<endl;
 return 0;
}