제출 #985541

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
985541		ag_1204	서열 (APIO23_sequence)	C++17	28 / 100	2066 ms	51216 KiB

sequence

#include<bits/stdc++.h>
using namespace std;

int sequence(int N, std::vector<int> A) {
    int ans=0;
    for (int i=0;i<N;i++) {
        map<int,int> m;
        multiset<int> low, high;
        for (int j=i;j<N;j++) {
            if (low.empty() || A[j]<=*low.rbegin()) {
                low.insert(A[j]);
            } else {
                high.insert(A[j]);
            }
            while (low.size() > high.size() + 1) {
                high.insert(*low.rbegin());
                low.erase(prev(low.end()));
            }
            while (high.size() > low.size()) {
                low.insert(*high.begin());
                high.erase(high.begin());
            }
            m[A[j]]++;
            int m1 = *low.rbegin();
            int m2 = (low.size()+high.size())%2==0?*high.begin():m1;
            int occ1 = m[m1], occ2=m[m2];
            ans = max(ans,occ1);
            if (m1!=m2) {
                ans=max(ans,occ2);
            }
        }
    }
    return ans;
}

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