# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1238578 | Jer | Infinite Race (EGOI24_infiniterace2) | C++20 | 12 ms | 1348 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int laps[MAXN];
bool ahead[MAXN];
int n, q;
int main()
{
scanf("%d%d", &n, &q);
fill(laps, laps + n, 0);
int a, res = 0;
while (q--)
{
scanf("%d", &a);
if (a > 0)
laps[a] += (ahead[a]), ahead[a] = true, res = max(res, laps[a]);
else
ahead[-a] = false;
}
printf("%d\n", res);
return 0;
}
Compilation message (stderr)
# | 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... |