Submission #1099325

#TimeUsernameProblemLanguageResultExecution timeMemory
1099325dmn223Infinite Race (EGOI24_infiniterace2)C++17
0 / 100
35 ms1876 KiB
#include <bits/stdc++.h> using namespace std; map<int,int>m; int n, q, x, r = -1e9; bool a[200001], b[200001]; int main() { cin >> n >> q; while(q--) { cin >> x; if(x > 0) { if(a[x] == true) { m[x + 200000]++; r = max(r, m[x + 200000]); } else a[x] = true; } else { m[-x]--; r = max(r, m[-x]); } } cout << r; 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...