CodeForces - 1003A Polycarp‘s Pockets

A. Polycarp’s Pockets
time limit per test1 second
memory limit per test256 megabytes

Polycarp has n coins, the value of the i-th coin is ai. Polycarp wants to distribute all the coins between his pockets, but he cannot put two coins with the same value into the same pocket.

For example, if Polycarp has got six coins represented as an array a=[1,2,4,3,3,2], he can distribute the coins into two pockets as follows: [1,2,3],[2,3,4].

Polycarp wants to distribute all the coins with the minimum number of used pockets. Help him to do that.

Input
The first line of the input contains one integer n (1≤n≤100) — the number of coins.

The second line of the input contains n integers a1,a2,…,an (1≤ai≤100) — values of coins.

Output
Print only one integer — the minimum number of pockets Polycarp needs to distribute all the coins so no two coins with the same value are put into the same pocket.

Examples
input
6
1 2 4 3 3 2
output
2
input
1
100
output
1

问题链接：CodeForces - 1003A Polycarp’s Pockets
问题简述：（略）
问题分析：（略）
AC的C++语言程序如下：

#include 

using namespace std;

const int A = 100;
int cnt[A + 1];

int main()
{
    int n, a, maxcnt = 0;
    scanf("%d", &n);
    memset(cnt, 0, sizeof cnt);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a);
        maxcnt = max(maxcnt, ++cnt[a]);
    }
    printf("%dn", maxcnt);

    return 0;
}