제출 #983345

#제출 시각아이디문제언어결과실행 시간메모리
983345vjudge1서열 (APIO23_sequence)C++17
28 / 100
2048 ms30752 KiB
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace std;
using namespace __gnu_pbds;

#define ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> 

int sequence(int n, std::vector<int> a) {
	int ans = 0;
	for(int i = 0; i < n; i++){
		ordered_multiset st;
		for(int j = i; j < n; j++){
			st.insert(a[j]);
			int len = j - i + 1;
			int f = *st.find_by_order((len - 1) / 2);
			int s = *st.find_by_order(len / 2);
			ans = max(ans, (int)st.order_of_key(f + 1) - (int)st.order_of_key(f));
			ans = max(ans, (int)st.order_of_key(s + 1) - (int)st.order_of_key(s));
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...