제출 #1240946

#제출 시각아이디문제언어결과실행 시간메모리
1240946aren_danceTeam Coding (EGOI24_teamcoding)C++20
12 / 100
33 ms1092 KiB
#include <bits/stdc++.h> using namespace std; const int N=5e5; int c[N]; int pref[N]; int main() { int n,k;cin>>n>>k; int x; for(int i=0;i<n;++i){ cin>>c[i]; } for(int i=1;i<n;++i){ cin>>x; } int answ=0; for(int i=n-1;i>=0;--i){ pref[c[i]]++; answ=max(answ,pref[c[i]]); } cout<<answ<<" "<<0; return 0; }
#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...