Submission #919647

#	Time	Username	Problem	Language	Result	Execution time	Memory
919647		JakobZorz	Sequence (APIO23_sequence)	C++17	11 / 100	2052 ms	35408 KiB

sequence

#include"sequence.h"
#include<vector>
using namespace std;

int n;
int arr2[500000];
int tree1[500000];
vector<int>arr[500000];

int sequence(int N,vector<int>A){
    n=N;
    for(int i=0;i<n;i++){
        arr[A[i]-1].push_back(i);
        arr2[i]=A[i]-1;
        tree1[i]=-1;
    }
    
    int res=0;
    for(int v=0;v<n;v++){
        for(int idx:arr[v]){
            tree1[idx]=1;
            
            for(int i=0;i<n;i++){
                int sum=0,num=0;
                for(int j=i;j<n;j++){
                    sum+=tree1[j];
                    if(arr2[j]==v)
                        num++;
                    if(0<=sum&&sum<=1)
                        res=max(res,num);
                }
            }
        }
    }
    
    return res;
}

• 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