제출 #1178901

#제출 시각아이디문제언어결과실행 시간메모리
1178901MuhammetSequence (APIO23_sequence)C++17
0 / 100
270 ms27768 KiB
#include "bits/stdc++.h" #include "sequence.h" // #include "grader.cpp" using namespace std; #define SZ(s) (int)s.size() map <int, int> vis; int sequence(int n, vector<int> a) { int ans = 0; for(int i = 0; i < n; i++) { vis[a[i]]++; ans = max(ans, vis[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...