# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
3161 |
2013-08-26T12:45:14 Z |
kipa00 |
지능형 기차 2 (KOI11_train2) |
C++ |
|
0 ms |
1088 KB |
#include <cstdio>
int main() {
int i, n = 0, max = -1;
bool nowplus = false;
while (scanf("%d", &i) == 1) {
if (nowplus) {
n += i;
} else {
n -= i;
}
if (max < n) {
max = n;
}
nowplus = !nowplus;
}
printf("%d\n", max);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
6 |
Correct |
0 ms |
1088 KB |
Output is correct |
7 |
Correct |
0 ms |
1088 KB |
Output is correct |
8 |
Correct |
0 ms |
1088 KB |
Output is correct |
9 |
Correct |
0 ms |
1088 KB |
Output is correct |
10 |
Correct |
0 ms |
1088 KB |
Output is correct |