| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333858 | hmms127 | 서열 (APIO23_sequence) | C++20 | 2091 ms | 6520 KiB |
#include "sequence.h"
#include <vector>
#include "bits/stdc++.h"
#define pb push_back
using namespace std;
int sequence(int n, vector<int> a) {
sort(a.begin(),a.end());
int ans=0;
for (int l=0;l<n;l++) {
vector<int>v;vector<int>frq(n+1,0);
for (int r=l;r<n;r++) {
v.pb(a[r]);
frq[a[r]]++;
sort(v.begin(),v.end());
if ((r-l+1)%2) {
ans=max(ans,frq[v[(int)(v.size()/2)]]);
}
else ans=max({ans,frq[v[(int)(v.size()/2)]],frq[v[(int)(v.size()/2)-1]]});
}
}
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... | ||||
