Submission #1200209

#	Time	Username	Problem	Language	Result	Execution time	Memory
1200209		tegshzaya	Sequence (APIO23_sequence)	C++20	0 / 100	2099 ms	58952 KiB

sequence

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define endl "\n"
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
template<typename T> using ordered_multiset=tree<pair<T, int>,null_type,less<pair<T, int>>,rb_tree_tag,tree_order_statistics_node_update>;
int sequence(int n, vector<int> v){
    int u=0,d=0;
    map<int,int> m;
    for (int i=0; i<n; i++)
	{ordered_multiset<int> os;
    m.clear();
        for (int j=0; j<=n-1; j++)
		{int val=v[i+j-1];
		m[val]++;
        os.insert({val,d++});
        int sz=os.size();
        if (sz%2==1){int m1=os.find_by_order(sz/2)->first;u=max(u,m[m1]);}
		else{int m1=os.find_by_order(sz/2-1)->first;int m2=os.find_by_order(sz/2)->first;u=max({u,m[m1],m[m2]});}
        }
    }
    return u;
}

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