This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 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... |