| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1326605 | eri16 | 서열 (APIO23_sequence) | C++20 | 31 ms | 4148 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;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
