Submission #1326596

#	Time	Username	Problem	Language	Result	Execution time	Memory
1326596		eri16	Sequence (APIO23_sequence)	C++20	28 / 100	2096 ms	27612 KiB

sequence

#include <bits/stdc++.h>
#include "sequence.h"

using namespace std;

int sequence(int n, vector<int> a){
    int ans = 0;

    for (int i=0; i<n; i++){
        priority_queue<int> niedrig; 
        priority_queue<int, vector<int>, greater<int>> hoch;
        unordered_map<int, int> cnt;

        for (int j=i; j<n; j++){
            int x=a[j];
            cnt[x]++;

            if (niedrig.empty() || x <= niedrig.top()){niedrig.push(x);}
            else{hoch.push(x);}
            
            while (niedrig.size() > hoch.size()+1){
                hoch.push(niedrig.top());
                niedrig.pop();
            }
            
            while (hoch.size() > niedrig.size()){
                niedrig.push(hoch.top());
                hoch.pop();
            }

            ans = max(ans, cnt[niedrig.top()]); 

            if ((niedrig.size() + hoch.size())%2==0){
                ans=max(ans, cnt[hoch.top()]); 
            }
        }
    }
    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