Submission #1364639

#	Time	Username	Problem	Language	Result	Execution time	Memory
1364639		thesentro	Sequence (APIO23_sequence)	C++20	0 / 100	2098 ms	62848 KiB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
multiset<ll>m1, m2;
ll med1()
{
    return *(--m1.end());
}
ll med2()
{
    return *m2.begin();
}
void bal()
{
    while (m1.size()>m2.size()+1)
    {
        m2.insert(*(--m1.end()));
        m1.erase((--m1.end()));
    }
}
void add(ll x)
{
    m1.insert(x);
    bal();
}
int sequence(int N, std::vector<int> A) {
    ll n = N;
    vector<ll>v;
    v.push_back(0);
    for (int i=0 ; i<n ; i++)
        v.push_back(A[i]);
    ll res = 0;
    for (int i=1 ; i<=n ;i++)
    {
        map<ll,ll>frq;
        m1.clear();
        m2.clear();
        for (int j=i ; j<=n ;j++)
        {
            add(v[j]);
            frq[v[j]]++;
            if ((j-i+1)%2)
                res = max(res, frq[med1()]);
            else
                res = max({res, frq[med1()], frq[med2()]});
        }
    }
    return res;
}
/*
14
2 6 2 5 3 4 2 1 4 3 5 6 3 2


*/

• 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