CSES - KILO 2017 2/5

CSES - KILO 2017 2/5 - Results

Submission details
Task:	Odd sequence
Sender:	Kalle Luopajärvi
Submission time:	2017-09-12 18:09:57 +0300
Language:	C++
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.55 s	details
#2	ACCEPTED	0.35 s	details
#3	ACCEPTED	0.23 s	details
#4	ACCEPTED	0.56 s	details
#5	ACCEPTED	0.04 s	details
#6	ACCEPTED	0.04 s	details
#7	ACCEPTED	0.04 s	details
#8	ACCEPTED	0.04 s	details
#9	ACCEPTED	0.03 s	details
#10	ACCEPTED	0.04 s	details
#11	ACCEPTED	0.03 s	details
#12	ACCEPTED	0.04 s	details
#13	ACCEPTED	0.03 s	details
#14	ACCEPTED	0.03 s	details
#15	ACCEPTED	0.05 s	details
#16	ACCEPTED	0.03 s	details
#17	ACCEPTED	0.05 s	details
#18	ACCEPTED	0.05 s	details
#19	ACCEPTED	0.02 s	details
#20	ACCEPTED	0.04 s	details
#21	ACCEPTED	0.03 s	details
#22	ACCEPTED	0.05 s	details
#23	ACCEPTED	0.04 s	details
#24	ACCEPTED	0.04 s	details
#25	ACCEPTED	0.04 s	details
#26	ACCEPTED	0.03 s	details
#27	ACCEPTED	0.04 s	details
#28	ACCEPTED	0.05 s	details
#29	ACCEPTED	0.05 s	details
#30	ACCEPTED	0.05 s	details
#31	ACCEPTED	0.04 s	details
#32	ACCEPTED	0.03 s	details
#33	ACCEPTED	0.05 s	details
#34	ACCEPTED	0.04 s	details
#35	ACCEPTED	0.05 s	details
#36	ACCEPTED	0.04 s	details
#37	ACCEPTED	0.04 s	details
#38	ACCEPTED	0.04 s	details
#39	ACCEPTED	0.04 s	details
#40	ACCEPTED	0.04 s	details
#41	ACCEPTED	0.03 s	details
#42	ACCEPTED	0.05 s	details
#43	ACCEPTED	0.04 s	details
#44	ACCEPTED	0.02 s	details
#45	ACCEPTED	0.04 s	details
#46	ACCEPTED	0.05 s	details
#47	ACCEPTED	0.05 s	details
#48	ACCEPTED	0.05 s	details
#49	ACCEPTED	0.05 s	details
#50	ACCEPTED	0.05 s	details
#51	ACCEPTED	0.05 s	details

Code

#include <bits/stdc++.h>
using namespace std;
const int N = 1<<20;
int left[2*N];
int right[2*N];
int best[2*N];
int sum[2*N];
typedef long long ll;
ll t[N];
int n;
ll f() {
	ll sum = 0;
	ll ma = 0;
	for(int i = 0; i < n; ++i) {
		sum += t[i];
		if(sum < 0) sum = 0;
		ma = max(ma, sum);
	}
	return ma;
}
int main() {
	cin>>n;
	for(int i = 0; i < n; ++i) {
		cin>>t[i];
		if(i % 2 == 0) t[i] += (ll)1e16;
		else t[i] -= (ll)1e16;
	}
	ll ma = f();
	for(int i = 0; i < n; ++i) {
		if(i % 2 == 0) t[i] -= (ll)1e16;
		else t[i] += (ll)1e16;
	}
	for(int i = 0; i < n; ++i) {
		if(i % 2 == 0) t[i] -= (ll)1e16;
		else t[i] += (ll)1e16;
	}
	ma = max(ma, f());
	cout<<ma-(ll)1e16<<endl;

	/*
	for(int i = N-1; i >= 0; --i) {
		left[i] = max(left[2*i], sum[2*i]+left[2*+1]);
		left[i] = max(left[i], sum[2*i]);
		right[i] = max(right[2*i+1], sum[2*i+1]+right[2*i])
	}
	*/
}

Test details

Test 1

Verdict: ACCEPTED

input
`1000000 0 99833416 198669330 295520206...` view save

correct output
`20008336040` view save

user output
`20008336040` view save

Test 2

Verdict: ACCEPTED

input
`1000000 -84 -60 -41 -100 8 -8 -52 -62 ...` view save

correct output
`48760` view save

user output
`48760` view save

Test 3

Verdict: ACCEPTED

input
`1000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`5300` view save

user output
`5300` view save

Test 4

Verdict: ACCEPTED

input
`1000000 13915014 -15160138 25244495 40...` view save

correct output
`105192740048` view save

user output
`105192740048` view save

Test 5

Verdict: ACCEPTED

input
`10 1 1 -1 -1 -1 1 0 -1 1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 6

Verdict: ACCEPTED

input
`10 0 -1 1 -1 -1 -1 1 1 -1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 7

Verdict: ACCEPTED

input
`10 1 0 1 -1 0 1 1 1 -1 0` view save

correct output
`3` view save

user output
`3` view save

Test 8

Verdict: ACCEPTED

input
`10 1 0 1 -1 0 1 -1 -1 0 1` view save

correct output
`2` view save

user output
`2` view save

Test 9

Verdict: ACCEPTED

input
`10 0 0 0 0 0 -1 1 -1 1 1` view save

correct output
`1` view save

user output
`1` view save

Test 10

Verdict: ACCEPTED

input
`10 1 -1 -1 1 1 0 1 0 1 0` view save

correct output
`4` view save

user output
`4` view save

Test 11

Verdict: ACCEPTED

input
`10 0 1 -1 -1 -1 1 1 0 0 0` view save

correct output
`2` view save

user output
`2` view save

Test 12

Verdict: ACCEPTED

input
`10 1 -1 -1 -1 -1 1 -1 1 0 1` view save

correct output
`2` view save

user output
`2` view save

Test 13

Verdict: ACCEPTED

input
`10 -1 0 1 0 -1 1 -1 0 1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 14

Verdict: ACCEPTED

input
`10 1 -1 0 1 0 0 -1 0 -1 1` view save

correct output
`1` view save

user output
`1` view save

Test 15

Verdict: ACCEPTED

input
`10 1 1 1 0 -1 1 0 1 -1 1` view save

correct output
`3` view save

user output
`3` view save

Test 16

Verdict: ACCEPTED

input
`10 -1 1 1 0 -1 -1 0 1 0 1` view save

correct output
`2` view save

user output
`2` view save

Test 17

Verdict: ACCEPTED

input
`10 -1 -1 1 0 1 -1 1 1 1 -1` view save

correct output
`4` view save

user output
`4` view save

Test 18

Verdict: ACCEPTED

input
`10 -1 -1 -1 0 1 1 0 -1 1 -1` view save

correct output
`2` view save

user output
`2` view save

Test 19

Verdict: ACCEPTED

input
`10 -1 -1 0 -1 -1 -1 -1 0 1 1` view save

correct output
`2` view save

user output
`2` view save

Test 20

Verdict: ACCEPTED

input
`10 0 0 -1 -1 1 -1 0 0 1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 21

Verdict: ACCEPTED

input
`10 -1 -1 -1 0 0 1 -1 1 0 0` view save

correct output
`1` view save

user output
`1` view save

Test 22

Verdict: ACCEPTED

input
`10 0 0 -1 1 0 -1 0 0 1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 23

Verdict: ACCEPTED

input
`10 -1 0 0 1 0 0 0 0 1 0` view save

correct output
`2` view save

user output
`2` view save

Test 24

Verdict: ACCEPTED

input
`10 0 0 1 1 1 0 1 -1 1 0` view save

correct output
`4` view save

user output
`4` view save

Test 25

Verdict: ACCEPTED

input
`10 -1 0 1 0 -1 0 1 0 1 0` view save

correct output
`2` view save

user output
`2` view save

Test 26

Verdict: ACCEPTED

input
`10 1 -1 -1 1 1 -1 1 1 -1 0` view save

correct output
`3` view save

user output
`3` view save

Test 27

Verdict: ACCEPTED

input
`10 -1 1 -1 1 1 -1 -1 1 1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 28

Verdict: ACCEPTED

input
`10 -1 0 -1 -1 -1 -1 -1 -1 -1 1` view save

correct output
`1` view save

user output
`1` view save

Test 29

Verdict: ACCEPTED

input
`10 1 0 -1 0 0 -1 0 1 -1 0` view save

correct output
`1` view save

user output
`1` view save

Test 30

Verdict: ACCEPTED

input
`10 -1 1 0 0 -1 1 1 1 0 1` view save

correct output
`4` view save

user output
`4` view save

Test 31

Verdict: ACCEPTED

input
`10 1 1 -1 -1 0 0 1 0 1 -1` view save

correct output
`2` view save

user output
`2` view save

Test 32

Verdict: ACCEPTED

input
`10 1 1 0 1 0 1 0 1 1 0` view save

correct output
`6` view save

user output
`6` view save

Test 33

Verdict: ACCEPTED

input
`10 -1 0 -1 1 1 1 1 -1 1 -1` view save

correct output
`3` view save

user output
`3` view save

Test 34

Verdict: ACCEPTED

input
`10 -1 0 1 1 -1 -1 1 -1 -1 0` view save

correct output
`2` view save

user output
`2` view save

Test 35

Verdict: ACCEPTED

input
`10 -1 -1 -1 1 0 1 -1 0 1 1` view save

correct output
`3` view save

user output
`3` view save

Test 36

Verdict: ACCEPTED

input
`10 0 1 1 -1 -1 -1 1 0 0 0` view save

correct output
`2` view save

user output
`2` view save

Test 37

Verdict: ACCEPTED

input
`10 -1 1 -1 -1 0 0 -1 0 -1 1` view save

correct output
`1` view save

user output
`1` view save

Test 38

Verdict: ACCEPTED

input
`10 -1 1 0 0 0 0 1 -1 -1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 39

Verdict: ACCEPTED

input
`10 -1 -1 -1 1 -1 1 1 1 -1 1` view save

correct output
`3` view save

user output
`3` view save

Test 40

Verdict: ACCEPTED

input
`10 0 -1 -1 -1 1 1 1 1 0 1` view save

correct output
`4` view save

user output
`4` view save

Test 41

Verdict: ACCEPTED

input
`10 1 -1 0 1 0 0 0 -1 1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 42

Verdict: ACCEPTED

input
`10 -1 0 -1 1 0 -1 0 0 0 -1` view save

correct output
`1` view save

user output
`1` view save

Test 43

Verdict: ACCEPTED

input
`10 -1 -1 1 0 1 -1 -1 -1 1 -1` view save

correct output
`2` view save

user output
`2` view save

Test 44

Verdict: ACCEPTED

input
`10 1 0 0 -1 1 -1 -1 1 0 0` view save

correct output
`1` view save

user output
`1` view save

Test 45

Verdict: ACCEPTED

input
`10 1 1 0 -1 1 1 1 -1 0 0` view save

correct output
`4` view save

user output
`4` view save

Test 46

Verdict: ACCEPTED

input
`10 1 0 -1 1 -1 0 0 1 -1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 47

Verdict: ACCEPTED

input
`10 0 1 -1 0 1 1 1 0 -1 -1` view save

correct output
`3` view save

user output
`3` view save

Test 48

Verdict: ACCEPTED

input
`10 0 0 1 -1 0 1 -1 0 0 -1` view save

correct output
`1` view save

user output
`1` view save

Test 49

Verdict: ACCEPTED

input
`10 -1 0 1 1 0 -1 1 0 -1 1` view save

correct output
`2` view save

user output
`2` view save

Test 50

Verdict: ACCEPTED

input
`10 -1 1 0 1 -1 -1 -1 -1 1 0` view save

correct output
`2` view save

user output
`2` view save

Test 51

Verdict: ACCEPTED

input
`3 -10 -5 -2` view save

correct output
`-2` view save

user output
`-2` view save

KILO 2017 2/5

Odd sequence

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Tasks

Submissions (Kalle Luopajärvi)