Submission #977721

#	Time	Username	Problem	Language	Result	Execution time	Memory
977721		Nexus	Sequence (APIO23_sequence)	C++17	11 / 100	2054 ms	11188 KiB

sequence

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

using namespace std;

const ll N=3e5+9,M=2e18+9,L=18,mod=1e9+7;

ll n,x,y;
multiset<ll>s;
map<ll,ll>m;

int sequence(int N, vector<int> A) {

    ll ans=0;

    for(ll i=0;i<N;++i)
    {
        s.clear();
        m.clear();
        for(ll j=i;j<N;++j)
        {
            s.insert(A[j]);
            ++m[A[j]],x=0;
            for(auto k:s)
            {
                ++x;
                if(2*x==j-i+1)
                {
                    ans=max(ans,m[k]);
                }
                if(2*x>j-i+1)
                {
                    ans=max(ans,m[k]);
                    break;
                }
            }
        }
    }

    return ans;
}

/*
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    cin>>n;
    vector<int>v(n);
    for(auto &i:v)cin>>i;
    cout<<sequence(n,v);
}
*/

• 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