# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757014 | Valters07 | Sequence (APIO23_sequence) | C++17 | 945 ms | 74656 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "sequence.h"
#define ll long long
#define pb push_back
#define fi first
#define se second
using namespace std;
int sequence(int n, vector<int> a)
{
int peak = 0;
while(peak+1<n&&a[peak]<=a[peak+1])
peak++;
int res = 1, l = 0, r;
for(int i = 1;i<n;i++)
if(a[i]!=a[i-1])
l=i;
else
res=max(res,i-l+1);
map<int,int> fir, lst, cnt;
for(int i = 0;i<n;i++)
{
if(!fir.count(a[i]))
fir[a[i]]=i;
lst[a[i]]=i;
cnt[a[i]]++;
}
for(auto x:cnt)
{
int mi = fir[x.fi]+(n-lst[x.fi]-1), cur = x.se, mx = n-mi-cur;
int st = 0;
if(mi<mx)
st=mx-mi;
if(st<=cur)
res=max(res,cur);
}
return res;
}
Compilation message (stderr)
# | 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... |