寻找小水王

 1 #include<iostream>
 2 using namespace std;
 3  
 4 void Waterking_find(int ID[],int num)                 
 5 {
 6     int waterking[3]={0,0,0};
 7     int count[3]={0,0,0};
 8     for(int i=0;i<num;i++)
 9     {
10         if(count[0]==0&&ID[i]!=waterking[1]&&ID[i]!=waterking[2])
11         {
12             waterking[0]=ID[i];
13             count[0]++;
14         }
15         if(count[1]==0&&ID[i]!=waterking[0]&&ID[i]!=waterking[2])
16         {
17             waterking[1]=ID[i];
18             count[1]++;
19         }
20         if(count[2]==0&&ID[i]!=waterking[0]&&ID[i]!=waterking[1])
21         {
22             waterking[2]=ID[i];
23             count[2]++;
24         }
25         if(ID[i]==waterking[0])
26         {
27             count[0]++;
28         }
29         if(ID[i]==waterking[1])
30         {
31             count[1]++;
32         }
33         if(ID[i]==waterking[2])
34         {
35             count[2]++;
36         }
37         if(ID[i]!=waterking[0]&&ID[i]!=waterking[1]&&ID[i]!=waterking[1])
38         {
39             count[0]--;
40             count[1]--;
41             count[2]--;
42         }
43 
44     }
45     cout<<"这三个水王分别是："<<waterking[0]<<" "<<waterking[1]<<" "<<waterking[2]<<endl;
46 }
47 int main()
48 { 
49     int Num;
50     int ID[14];
51     cout<<"请输入发帖子的数量："<<endl;
52     cin>>Num;
53     cout<<"输入发送每个帖子的ID："<<endl;
54     for(int i=0;i<Num;i++)
55     {
56         cin>>ID[i];
57     }
58     Waterking_find(ID,Num);
59     return 0;
60 }