Submission #983358

#TimeUsernameProblemLanguageResultExecution timeMemory
983358vjudge1서열 (APIO23_sequence)C++17
0 / 100
248 ms27604 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) {
	map<int,int> cnt;
	for(int i : a) cnt[i]++;
	int ans = 0;
	for(auto [val, count] : cnt) ans = max(ans, count);
	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...