| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1326594 | eri16 | Sequence (APIO23_sequence) | C++20 | 2096 ms | 6964 KiB |
#include <bits/stdc++.h>
#include "sequence.h"
using namespace std;
int sequence(int n, vector<int> a){
int ans=0;
for (int i=0; i<n; i++){
multiset<int> st;
unordered_map<int, int> cnt;
for (int j=i; j<n; j++){
st.insert(a[j]);
cnt[a[j]]++;
auto it=st.begin();
int sz=st.size();
advance(it, sz/2);
ans=max(ans, cnt[*it]);
if (sz%2==0){
auto it2=st.begin();
advance(it2, sz/2-1);
ans=max(ans,cnt[*it2]);
}
}
}
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... | ||||
