Submission #919599

#	Time	Username	Problem	Language	Result	Execution time	Memory
919599		JakobZorz	Sequence (APIO23_sequence)	C++17	11 / 100	2041 ms	38732 KiB

sequence

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

int n;
int tree1[500000];
int tree2[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);
        tree1[i]=-1;
        tree2[i]=-1;
    }
    
    int res=0;
    for(int v=0;v<n;v++){
        if(arr[v].empty())
            continue;
        for(int i:arr[v])
            tree1[i]=1;
        
        for(int i=0;i<n;i++){
            int sum1=0,sum2=0,num=0;
            for(int j=i;j<n;j++){
                sum1+=tree1[j];
                sum2+=tree2[j];
                if(tree1[j]==1&&tree2[j]==-1)
                    num++;
                if(sum1>=0&&sum2<=0)
                    res=max(res,num);
            }
        }
        
        for(int i:arr[v])
            tree2[i]=1;
    }
    
    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