#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, q, a;
cin >> n >> q;
int maxi = 0, lap = 0;
const int inf = 0x3f3f3f3f;
unordered_map<int, int> part;
int state[n]; // in which lap they have been overtaken by Anika
part.reserve(8192);
memset(state, 0x3f, sizeof(state));
while(q--){
cin >> a;
if(a < 0){
if(state[a] < lap) state[a] = inf;
}
else{
if(state[a] <= lap) {
part[a]++;
lap++;
}
state[a] = lap;
}
maxi = max(maxi, part[a]);
}
cout << maxi << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |