1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

int findLeader(const vector<int>& sequence) {
    unordered_map<int, int> counts;
    int n = sequence.size();

    for (int num : sequence) {
        counts[num]++;
        if (counts[num] > n / 2) {
            return num;
        }
    }

    return -1; // Brak lidera w ciągu
}

int main() {
    int n;
    cin >> n;

    vector<int> sequence(n);
    for (int i = 0; i < n; ++i) {
        cin >> sequence[i];
    }

    int leader = findLeader(sequence);

    unordered_map<int, int> leaderCounts;
    int maxLeaders = 0;

    for (int i = 0; i < n; ++i) {
        leaderCounts[sequence[i]]++;
        maxLeaders = max(maxLeaders, leaderCounts[sequence[i]]);
    }

    cout << maxLeaders << endl;

    return 0;
}