Submission #1206986

#TimeUsernameProblemLanguageResultExecution timeMemory
1206986trimkusInfinite Race (EGOI24_infiniterace2)C++20
29 / 100
86 ms10640 KiB
#include <bits/stdc++.h>
using namespace std;


int main() {
	int n;
	int q;
	cin >> n >> q;
	vector<int> cnt(n + 1);
	set<int> over;
	for (int i = 0; i < q; ++i) {
		int x;
		cin >> x;
		if (x < 0) {
			x = -x;
			over.erase(x);
		} else {
			if (over.count(x)) {
				cnt[x]++;
				over.clear();
			}
			over.insert(x);
		}
	}
	cout << *max_element(begin(cnt), end(cnt)) << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...