제출 #983347

#제출 시각아이디문제언어결과실행 시간메모리
983347vjudge1Sequence (APIO23_sequence)C++17
0 / 100
1081 ms2097152 KiB
#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; 
  
#define ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> 

#define pb push_back

int sequence(int n, std::vector<int> a) {
	int ans = 0;
	int pref[n + 1][n + 1];
	for(int i = 0;i <= n;i++)pref[0][i] = 0;
	for(int i = 0;i < n;i++){
		for(int j = 0;j <= n;j++)pref[i + 1][j] = pref[i][j];
		pref[i + 1][a[i]]++;
		ans = max(ans,pref[i + 1][a[i]]);
	}
	
	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...