Submission #901338

#	Time	Username	Problem	Language	Result	Execution time	Memory
901338		tkm_algorithms	Sequence (APIO23_sequence)	C++17	0 / 100	2035 ms	5316 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

int sequence(int n, vector<int> a) {
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        vector<int> b;
        map<int, int> mp;
        for (int j = i; j < n; ++j) {
            b.push_back(a[j]);
            mp[a[j]]++;
            sort(b.begin(), b.end());
            int d = b[b.size() / 2], d2 = b[(b.size() + 1) / 2];
            ans = max({ans, mp[d], mp[d2]});
        }
    }
    return ans;
}

//int main() {
//    int n;
//    cin >> n;
//    vector<int> a(n);
//    for (int i = 0; i < n; ++i)
//        cin >> a[i];
//    cout << sequence(n, a);
//    return 0;
//}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 17
• Subtask 3: 0 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18