# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758044 | tkm_algorithms | Sequence (APIO23_sequence) | C++17 | 0 ms | 0 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"
using namespace std;
using ll = long long;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
typedef pair<int, int> node;
typedef tree<node, null_type, less<node>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int sequence(int N, std::vector<int> A) {
int n = N;
vector<int> a = A;
int ans = 0;
for (int i = 0; i < n; i++) {
ordered_set setik;
map<int, int> mp;
for (int j = i; j < n; j++) {
setik.insert({a[j], j});
mp[a[j]]++;
int x = (*setik.find_by_order((j - i) / 2)).first;
ans = max(ans, mp[x]);
if ((j - i + 1) % 2 == 0) {
int x = (*setik.find_by_order((j - i) / 2 + 1)).first;
ans = max(ans, mp[x]);
}
}
}
return ans;
}
Saglygyna ulan :)