#include <bits/stdc++.h>
#define f0r(i,n) for(int i=0;i<n;i++)
typedef long long int ll;
using namespace std;
int main() {
int n, q, ans = 0; cin >> n >> q;
vector<int> cnt(n), cur(n);
while (q--) {
int a; cin >> a;
int idx = abs(a);
if (cur[idx] == 0) {
if (a > 0) cur[idx] = 1;
else cur[idx] = -1;
continue;
}
if (a > 0 && cur[idx] == 1) cnt[idx]++;
if (a > 0) cur[idx] = 1;
else cur[idx] = -1;
}
for (int i = 0; i < n; i++) {
ans = max(ans, cnt[i]);
}
cout << ans;
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... |