Submission #978913

#	Time	Username	Problem	Language	Result	Execution time	Memory
978913		rakhim_ova	Sequence (APIO23_sequence)	C++17	28 / 100	2051 ms	54492 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using indexed_set=tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update> ;

 
int sequence(int n, std::vector<int> a) {
    int res=0;
    for(int i=0; i<n; i++){
        indexed_set<int> ist;
        map<int, int> mp;
        for(int j=i; j<n; j++){
            ist.insert(a[j]);
            mp[a[j]]++;
            res=max(res, mp[*ist.find_by_order((j-i+1)/2)]);
            if((j-i+1)%2==0){
                res=max(res, mp[*ist.find_by_order((j-i+1)/2-1)]);
            }
        } 
    }
    return res;
}

• Subtask 1: 11 / 11
• Subtask 2: 17 / 17
• Subtask 3: 0 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18