| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1326604 | eri16 | Sequence (APIO23_sequence) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "sequence.h"
using namespace std;
int solve(const vector<int>& a, int median) {
int n=a.size();
int cnt=0;
int ans=0;
for (int i=0; i<n; i++) {
if (a[i]==median){cnt++;}
ans=max(ans, cnt);
}
return ans;
}
int sequence(int n, const vector<int>& a){
int ans=0;
for (int median=1; median<=3; median++) {
ans=max(ans,solve(a,median));
}
return ans;
}