Submission #977938

#	Time	Username	Problem	Language	Result	Execution time	Memory
977938		Nexus	Sequence (APIO23_sequence)	C++17	0 / 100	84 ms	31572 KiB

sequence

//#include "sequence.h"
#include <bits/stdc++.h>
#define ll long long
#define mid (r+l)/2

using namespace std;

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

ll n,x,y,z;
vector<ll>v[N];

int sequence(int N, vector<int> A) {
    x=1;
    for(ll i=0;i<N;++i)
    {
        if(i && A[i]==A[i-1])++y;
        else x=max(x,y),y=1;
        v[A[i]].push_back(i);
    }
    x=max(x,y);
    for(ll i=1;i<=N;++i)
    {
        if(v[i].size()<2)continue;
        y=v[i][v[i].size()-1]-v[i][0];
        z=y-v[i].size();
        if(z<=N/2)x=max(x,(ll)v[i].size());
    }
    return x;
}

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

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

• 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