Submission #1196202

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196202		Mohamed_Kachef06	서열 (APIO23_sequence)	C++20	0 / 100	38 ms	10056 KiB

sequence

#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
#include <vector>

int sequence(int N, std::vector<int> A) {
  int mx = 0; 
   int freq[N+1] = {}; 
   int frst[N+1] = {} , last[N+1] = {};
   memset(frst , -1 , sizeof frst); 
   memset(last , -1 , sizeof last); 
   for (int i = 0 ; i < N ; i++){
    if (frst[A[i]] == -1) frst[A[i]] = i;
    freq[A[i]]++; last[A[i]] = i; 
   }
   for (int i = 1 ; i <= N ; i++){
    if (freq[i] == 0) continue; 
    if (freq[i] * 2 >= last[i] - frst[i] + 1) mx = max(mx , freq[i]); 
   }
   return mx; 
}

• 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