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 <iostream>
using namespace std;
int m, n, x, maxx, a[200010];
int main() {
cin >> m >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x > 0) {
if (a[x] == maxx) a[x] = ++maxx;
else a[x] = maxx;
} else if (a[-x] != 0) a[-x]--;
}
cout << max(0,maxx-1) << endl;
}
# | 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... |