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;
const int N = 2e5 + 5;
int cnt[N], mx[N];
signed main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, q, x;
cin >> n >> q;
while (q--) {
cin >> x;
if (x < 0) cnt[-x] = max(0, cnt[-x] - 1);
else mx[x] = max(mx[x], cnt[x]++);
}
x = 0;
for (int i = 1; i < n; i++) x = max(x, mx[i]);
cout << x;
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... |