Submission #868343

#	Time	Username	Problem	Language	Result	Execution time	Memory
868343		irmuun	Sequence (APIO23_sequence)	C++17	28 / 100	2096 ms	29704 KiB

sequence

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

using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int sequence(int n,vector<int>A){
    int ans=1;
    int cnt[n+1];
    for(int i=0;i<n;i++){
        fill(cnt,cnt+n+1,0);
        multiset<int,greater<int>>l;
        multiset<int>r;
        for(int j=i;j<n;j++){
            cnt[A[j]]++;
            if(l.size()==r.size()){
                if(l.size()==0||A[j]>=*r.begin()){
                    r.insert(A[j]);
                }
                else{
                    int x=*l.begin();
                    r.insert(x);
                    l.erase(l.find(x));
                    l.insert(A[j]);
                }
                if(i!=j){
                    ans=max(ans,cnt[*r.begin()]);
                }
            }
            else{
                if(A[j]<=*r.begin()){
                    l.insert(A[j]);
                }
                else{
                    int x=*r.begin();
                    l.insert(x);
                    r.erase(r.find(x));
                    r.insert(A[j]);
                }
                ans=max({ans,cnt[*l.begin()],cnt[*r.begin()]});
            }
        }
    }
    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