# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3159 | kipa00 | 지능형 기차 2 (KOI11_train2) | C++98 | 0 ms | 1088 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 <cstdio>
int main() {
int i, n = 0, max = -1;
bool nowplus = true;
scanf("%d", &i);
do {
scanf("%d", &i);
if (nowplus) {
n += i;
} else {
n -= i;
}
if (max < n) {
max = n;
}
nowplus = !nowplus;
} while (n);
printf("%d\n", max);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |