Submission #1170525

#TimeUsernameProblemLanguageResultExecution timeMemory
1170525lopkusInfinite Race (EGOI24_infiniterace2)C++20
0 / 100
57 ms10568 KiB
#include <bits/stdc++.h> int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, q; std::cin >> n >> q; std::vector<int> a(q + 1); for(int i = 1; i <= q; i++) { std::cin >> a[i]; } int ans = 0; std::map<int,int> M; for(int i = 1; i <= q; i++) { M[a[i]] += 1; } M[a[1]] -= 1; for(int i = 1; i <= q; i++) { ans = std::max(ans, M[a[i]]); } std::cout << 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...