[HDOJ1800]Flying to the Mars

 1 #include <algorithm>
 2 #include <iostream>
 3 #include <iomanip>
 4 #include <cstring>
 5 #include <climits>
 6 #include <complex>
 7 #include <fstream>
 8 #include <cassert>
 9 #include <cstdio>
10 #include <bitset>
11 #include <vector>
12 #include <deque>
13 #include <queue>
14 #include <stack>
15 #include <ctime>
16 #include <set>
17 #include <map>
18 #include <cmath>
19 
20 using namespace std;
21 
22 const int maxn = 3010;
23 int n, x, c;
24 int s[maxn];
25 
26 int main() {
27     // freopen("in", "r", stdin);
28     while(~scanf("%d", &n)) {
29         c = 1;
30         x = 1;
31         for(int i = 0; i < n; i++) {
32             scanf("%d", &s[i]);
33         }
34         sort(s, s+n);
35         for(int i = 1; i < n; i++) {
36             s[i]==s[i-1]?x=max(x,++c):c=1;
37         }
38         printf("%d\n", x);
39     }
40 }