#include <iostream>
#include <unordered_map>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
unordered_map<int,int> rp;
int a = 0;
for (int i = 0; i < q; ++i) {
int x;
cin >> x;
if (x > 0) {
if (rp[x] >= a) ++a;
rp[x] = a - 1;
} else {
x = -x;
if (rp[x] < a) rp[x] = a;
}
}
cout << a << "\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... |