CSES - KILO 2017 2/5 - Results
Submission details
Task:Odd sequence
Sender:TEAM-Patonki
Submission time:2017-09-12 18:09:54 +0300
Language:Java
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.26 sdetails
#2ACCEPTED0.27 sdetails
#3ACCEPTED0.21 sdetails
#4ACCEPTED0.26 sdetails
#5ACCEPTED0.12 sdetails
#6ACCEPTED0.14 sdetails
#7ACCEPTED0.12 sdetails
#8ACCEPTED0.14 sdetails
#9ACCEPTED0.12 sdetails
#10ACCEPTED0.12 sdetails
#11ACCEPTED0.12 sdetails
#12ACCEPTED0.14 sdetails
#13ACCEPTED0.13 sdetails
#14ACCEPTED0.12 sdetails
#15ACCEPTED0.10 sdetails
#16ACCEPTED0.11 sdetails
#17ACCEPTED0.11 sdetails
#18ACCEPTED0.13 sdetails
#19ACCEPTED0.10 sdetails
#20ACCEPTED0.12 sdetails
#21ACCEPTED0.10 sdetails
#22ACCEPTED0.11 sdetails
#23ACCEPTED0.11 sdetails
#24ACCEPTED0.14 sdetails
#25ACCEPTED0.11 sdetails
#26ACCEPTED0.14 sdetails
#27ACCEPTED0.12 sdetails
#28ACCEPTED0.13 sdetails
#29ACCEPTED0.13 sdetails
#30ACCEPTED0.12 sdetails
#31ACCEPTED0.12 sdetails
#32ACCEPTED0.14 sdetails
#33ACCEPTED0.12 sdetails
#34ACCEPTED0.12 sdetails
#35ACCEPTED0.12 sdetails
#36ACCEPTED0.13 sdetails
#37ACCEPTED0.12 sdetails
#38ACCEPTED0.10 sdetails
#39ACCEPTED0.10 sdetails
#40ACCEPTED0.12 sdetails
#41ACCEPTED0.12 sdetails
#42ACCEPTED0.15 sdetails
#43ACCEPTED0.12 sdetails
#44ACCEPTED0.12 sdetails
#45ACCEPTED0.11 sdetails
#46ACCEPTED0.12 sdetails
#47ACCEPTED0.13 sdetails
#48ACCEPTED0.11 sdetails
#49ACCEPTED0.11 sdetails
#50ACCEPTED0.12 sdetails
#51ACCEPTED0.12 sdetails

Code

import java.util.ArrayList;
import java.util.Arrays;

public class Kilpalaatikko {

    public static void main(String[] args) {
        IO io = new IO();
        int n = io.nextInt();
        long[] pari = new long[n];
        long[] ton = new long[n];
        long[] tt = new long[n];

        for (int i = 0; i < n; i++) {
            tt[i] = io.nextInt();
        }
        pari[0] = 0;
        ton[0] = tt[0];
        long maksimi = tt[0];
        for (int i = 1; i < n; i++) {
            ton[i] = tt[i] + Math.max(0, pari[i - 1]);
            pari[i] = tt[i] + ton[i - 1];
            maksimi = Math.max(maksimi, ton[i]);
        }
//        for (int i = 0; i < n; i++) {
//            System.out.println(ton[i]);
//        }

        io.print(maksimi);
        io.close(); // TÄYTYY KUTSUA LOPUKSI, muuten tuloste voi jäädä kirjoittamatta

    }

}

Test details

Test 1

Verdict: ACCEPTED

input
1000000
0 99833416 198669330 295520206...

correct output
20008336040

user output
20008336040

Test 2

Verdict: ACCEPTED

input
1000000
-84 -60 -41 -100 8 -8 -52 -62 ...

correct output
48760

user output
48760

Test 3

Verdict: ACCEPTED

input
1000000
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

correct output
5300

user output
5300

Test 4

Verdict: ACCEPTED

input
1000000
13915014 -15160138 25244495 40...

correct output
105192740048

user output
105192740048

Test 5

Verdict: ACCEPTED

input
10
1 1 -1 -1 -1 1 0 -1 1 -1

correct output
1

user output
1

Test 6

Verdict: ACCEPTED

input
10
0 -1 1 -1 -1 -1 1 1 -1 -1

correct output
1

user output
1

Test 7

Verdict: ACCEPTED

input
10
1 0 1 -1 0 1 1 1 -1 0

correct output
3

user output
3

Test 8

Verdict: ACCEPTED

input
10
1 0 1 -1 0 1 -1 -1 0 1

correct output
2

user output
2

Test 9

Verdict: ACCEPTED

input
10
0 0 0 0 0 -1 1 -1 1 1

correct output
1

user output
1

Test 10

Verdict: ACCEPTED

input
10
1 -1 -1 1 1 0 1 0 1 0

correct output
4

user output
4

Test 11

Verdict: ACCEPTED

input
10
0 1 -1 -1 -1 1 1 0 0 0

correct output
2

user output
2

Test 12

Verdict: ACCEPTED

input
10
1 -1 -1 -1 -1 1 -1 1 0 1

correct output
2

user output
2

Test 13

Verdict: ACCEPTED

input
10
-1 0 1 0 -1 1 -1 0 1 -1

correct output
1

user output
1

Test 14

Verdict: ACCEPTED

input
10
1 -1 0 1 0 0 -1 0 -1 1

correct output
1

user output
1

Test 15

Verdict: ACCEPTED

input
10
1 1 1 0 -1 1 0 1 -1 1

correct output
3

user output
3

Test 16

Verdict: ACCEPTED

input
10
-1 1 1 0 -1 -1 0 1 0 1

correct output
2

user output
2

Test 17

Verdict: ACCEPTED

input
10
-1 -1 1 0 1 -1 1 1 1 -1

correct output
4

user output
4

Test 18

Verdict: ACCEPTED

input
10
-1 -1 -1 0 1 1 0 -1 1 -1

correct output
2

user output
2

Test 19

Verdict: ACCEPTED

input
10
-1 -1 0 -1 -1 -1 -1 0 1 1

correct output
2

user output
2

Test 20

Verdict: ACCEPTED

input
10
0 0 -1 -1 1 -1 0 0 1 -1

correct output
1

user output
1

Test 21

Verdict: ACCEPTED

input
10
-1 -1 -1 0 0 1 -1 1 0 0

correct output
1

user output
1

Test 22

Verdict: ACCEPTED

input
10
0 0 -1 1 0 -1 0 0 1 -1

correct output
1

user output
1

Test 23

Verdict: ACCEPTED

input
10
-1 0 0 1 0 0 0 0 1 0

correct output
2

user output
2

Test 24

Verdict: ACCEPTED

input
10
0 0 1 1 1 0 1 -1 1 0

correct output
4

user output
4

Test 25

Verdict: ACCEPTED

input
10
-1 0 1 0 -1 0 1 0 1 0

correct output
2

user output
2

Test 26

Verdict: ACCEPTED

input
10
1 -1 -1 1 1 -1 1 1 -1 0

correct output
3

user output
3

Test 27

Verdict: ACCEPTED

input
10
-1 1 -1 1 1 -1 -1 1 1 -1

correct output
1

user output
1

Test 28

Verdict: ACCEPTED

input
10
-1 0 -1 -1 -1 -1 -1 -1 -1 1

correct output
1

user output
1

Test 29

Verdict: ACCEPTED

input
10
1 0 -1 0 0 -1 0 1 -1 0

correct output
1

user output
1

Test 30

Verdict: ACCEPTED

input
10
-1 1 0 0 -1 1 1 1 0 1

correct output
4

user output
4

Test 31

Verdict: ACCEPTED

input
10
1 1 -1 -1 0 0 1 0 1 -1

correct output
2

user output
2

Test 32

Verdict: ACCEPTED

input
10
1 1 0 1 0 1 0 1 1 0

correct output
6

user output
6

Test 33

Verdict: ACCEPTED

input
10
-1 0 -1 1 1 1 1 -1 1 -1

correct output
3

user output
3

Test 34

Verdict: ACCEPTED

input
10
-1 0 1 1 -1 -1 1 -1 -1 0

correct output
2

user output
2

Test 35

Verdict: ACCEPTED

input
10
-1 -1 -1 1 0 1 -1 0 1 1

correct output
3

user output
3

Test 36

Verdict: ACCEPTED

input
10
0 1 1 -1 -1 -1 1 0 0 0

correct output
2

user output
2

Test 37

Verdict: ACCEPTED

input
10
-1 1 -1 -1 0 0 -1 0 -1 1

correct output
1

user output
1

Test 38

Verdict: ACCEPTED

input
10
-1 1 0 0 0 0 1 -1 -1 -1

correct output
1

user output
1

Test 39

Verdict: ACCEPTED

input
10
-1 -1 -1 1 -1 1 1 1 -1 1

correct output
3

user output
3

Test 40

Verdict: ACCEPTED

input
10
0 -1 -1 -1 1 1 1 1 0 1

correct output
4

user output
4

Test 41

Verdict: ACCEPTED

input
10
1 -1 0 1 0 0 0 -1 1 -1

correct output
1

user output
1

Test 42

Verdict: ACCEPTED

input
10
-1 0 -1 1 0 -1 0 0 0 -1

correct output
1

user output
1

Test 43

Verdict: ACCEPTED

input
10
-1 -1 1 0 1 -1 -1 -1 1 -1

correct output
2

user output
2

Test 44

Verdict: ACCEPTED

input
10
1 0 0 -1 1 -1 -1 1 0 0

correct output
1

user output
1

Test 45

Verdict: ACCEPTED

input
10
1 1 0 -1 1 1 1 -1 0 0

correct output
4

user output
4

Test 46

Verdict: ACCEPTED

input
10
1 0 -1 1 -1 0 0 1 -1 -1

correct output
1

user output
1

Test 47

Verdict: ACCEPTED

input
10
0 1 -1 0 1 1 1 0 -1 -1

correct output
3

user output
3

Test 48

Verdict: ACCEPTED

input
10
0 0 1 -1 0 1 -1 0 0 -1

correct output
1

user output
1

Test 49

Verdict: ACCEPTED

input
10
-1 0 1 1 0 -1 1 0 -1 1

correct output
2

user output
2

Test 50

Verdict: ACCEPTED

input
10
-1 1 0 1 -1 -1 -1 -1 1 0

correct output
2

user output
2

Test 51

Verdict: ACCEPTED

input
3
-10 -5 -2

correct output
-2

user output
-2