# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
742188 | rainboy | Separator (CEOI19_separator) | C11 | 242 ms | 25824 KiB |
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 <stdio.h>
#define N 1000000
#define MD 1000000000
int main() {
static int aa[N], qu[N];
static char ismax[N];
int n, cnt, i, a_, k;
scanf("%d", &n);
a_ = -1, k = 0, cnt = 0;
for (i = 0; i < n; i++) {
scanf("%d", &aa[i]), aa[i] = (aa[i] + k) % MD;
if (a_ < aa[i])
a_ = aa[i], ismax[i] = 1, k++;
while (cnt && aa[qu[cnt - 1]] >= aa[i])
if (ismax[qu[--cnt]])
k--;
qu[cnt++] = i;
printf("%d\n", k);
}
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... |