제출 #976319

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
976319		hocln	서열 (APIO23_sequence)	C++17	0 / 100	1004 ms	59216 KiB

sequence

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "sequence.h"
using namespace __gnu_pbds;
using namespace std;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(v) v.begin(), v.end()
#define logg(x) (31 - __builtin_clz(x))
#define llogg(x) (63 - __builtin_clzll(x))
#define mini(v) min_element(v.begin(), v.end())
#define maxi(v) max_element(v.begin(), v.end())
#define TIME cerr << double(clock() - st) / (double)CLOCKS_PER_SEC
#define sq(a) ((a)*(a))
#ifdef hocln
#include "deb.h"
#else
#define imie(...) ""
#define debug() cerr
#endif
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;
typedef tuple<ll, ll, ll> triple;
typedef tuple<ll, ll, ll, ll, ll> five;
typedef unsigned long long ull;
const long long INF = 4e18;
const int inf = 2e9;
const int MN = 3e5 + 15;
const int MX = 2e6 + 15;
//const long long MOD = 1e9 + 7;
const long long MOD = 998244353;
const long double PI = 3.141592653589793238462643383279502884197;
template<typename T, typename T2> bool chmax(T& a, const T2& b) { return a < b ? a = b, 1 : 0; }
template<typename T, typename T2> bool chmin(T& a, const T2& b) { return a > b ? a = b, 1 : 0; }
template<typename T> using vector2 = vector<vector<T>>;
const int dx[] = { 0, 0, 1, -1, 1, 1, -1, -1 };
const int dy[] = { 1, -1, 0, 0 , 1, -1, 1, -1};
std::random_device rd;
std::mt19937 gen(rd());
ll random(ll low, ll high) { uniform_int_distribution<> dist(low, high); return dist(gen); }
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p) {
    is >> p.first;
    return is >> p.second;
}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (auto &i: v) os << i << ' ';
    return os;
}
int tc = 0;



int sequence(int n, vector<int>v) {
	int ans = 0;
	for(int i = 0;i < 1;i++) { // i = L
		map<int,int>mp;
		Tree<pair<int,int>>st;
		int cnt = 0;
		for(int j = i;j < n;j++) { // j = R
			++mp[v[j]];
			st.insert({v[j],cnt++});
			chmax(ans, mp[st.find_by_order((j-i+1)/2)->first]);
			chmax(ans, mp[st.find_by_order((j-i)/2)->first]);
		}
		for(int j = 0;j < n;j++) {
			//st.insert({v[j],cnt++});
			chmax(ans, mp[st.find_by_order((j-i+1)/2)->first]);
			chmax(ans, mp[st.find_by_order((j-i)/2)->first]);
			--mp[v[j]];
			st.erase(st.find({v[j],j}));
		}
	}
	return ans;
}
// 
//inline void solve_test() {
	
//}

//int main()
//{
    ////srand(chrono::steady_clock::now().time_since_epoch().count());
    ////freopen("convention2.in", "r", stdin);
    ////freopen("convention2.out", "w", stdout);
	////cout << "Case #" << tc << ": " << ans << '\n';
	////cout << fixed << setprecision(7);
    ////ios::sync_with_stdio(0);
    ////cin.tie(0);cout.tie(0);
    ////int tt = 1;
    //////cin >> tt;
    ////while(tt--) {
		////++tc;
        ////solve_test();
    ////}
    //cout << sequence(14, {2, 6, 2, 5, 3, 4, 2, 1, 4, 3, 5, 6, 3, 2});
//}

• 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