#include "sequence.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<array<int,2>,null_type,less<array<int,2>>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
int sequence(int n, vector<int> arr) {
int ans = 0;
for(int i = 0;i<n;i++){
map<int,int>mp;
ordered_set os;
for(int j = i;j<n;j++){
mp[arr[j]]++;
os.insert({arr[j],j});
int len = (j-i+1);
len--;
int med1 = len/2;
med1=(*os.find_by_order(med1))[0];
int med2 = (len+1)/2;
med2=(*os.find_by_order(med2))[0];
ans=max({ans,mp[med1],mp[med2]});
}
}
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... |