Submission #737743

#	Time	Username	Problem	Language	Result	Execution time	Memory
737743		Ariadna	Izbori (COCI22_izbori)	C++14	0 / 110	3029 ms	724 KiB

Main

#include <bits/stdc++.h>
#define ll long long int

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector < int > a(n), aux;
    unordered_set < int > s;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        s.insert(a[i]);
    }
    int t = s.size();
    ll ans = n, ant;
    for (int i = 0; i < n; ++i) {
        aux = vector < int >(t, 0); 
        aux[a[i]] = 1;
        ant = a[i];
        for (int j = i + 1; j < n; ++j) {
            ++aux[a[j]];
            if (aux[a[j]] > aux[ant]) ans = a[j];
            if (aux[ant] > (j - i + 1) / 2) ++ans;
        }
    }
    cout << ans << '\n';
    
    
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 70