제출 #901317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
901317		tkm_algorithms	서열 (APIO23_sequence)	C++17	11 / 100	2067 ms	8284 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) {
        multiset<int> x;
        vector<int> mp(2100);
        for (int j = i; j < n; ++j) {
            x.insert(a[j]);
            mp[a[j]]++;
            int cnt = 0;
            int d = (j - i) >> 1;
            int b = (j - i + 1) >> 1;
            int c1 = 0, c2 = 0;
            for (auto k: x) {
                if (cnt == d)
                    c1 = k;
                if (cnt == b) {
                    c2 = k;
                    break;
                }
                ++cnt;
            }
            if (mp[c1] > ans)
                ans = mp[c1];
            if (mp[c2] > ans)
                ans = mp[c2];
//            cout << x.count(c1) << endl;
//            cout << x.count(c2) << endl;
        }
    }
    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: 11 / 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