#include <bits/stdc++.h>
using namespace std;
const int N=5e5;
int a[N];
bitset<N> fl;
int main()
{
int n,k;
cin>>n>>k;
int answ=0;
while(k--){
int x;
cin>>x;
if(x<0){
fl[-x]=0;
continue;
}
if(fl[x]==0){
fl[x]=1;
continue;
}
answ++;
fl&=0;
fl[x]=1;
}
for(int i=0;i<=n;++i){
answ=max(answ,a[i]);
}
cout<<answ;
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... |