Submission #9,694

2024-02-27 21:04:31

python3

Accepted 35/35

101ms

34688 KiB

#be = open("in.18")
n = int(input())
lista = list(map(int,input().split()))
sor = [lista[0],lista[0]+lista[1]]
for i in range(2,n):
    if sor[i-2] <= sor[i-1]:
        sor.append(sor[i-2]+lista[i])
    else:
        sor.append(sor[i-1]+lista[i])
print(sor[-1])

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	17ms	11068 KiB
		2	Accepted	0/0	101ms	32328 KiB
		3	Accepted	1/1	17ms	11904 KiB
		4	Accepted	1/1	17ms	11944 KiB
		5	Accepted	1/1	17ms	12036 KiB
		6	Accepted	1/1	17ms	12244 KiB
		7	Accepted	1/1	17ms	12084 KiB
		8	Accepted	2/2	18ms	12312 KiB
		9	Accepted	2/2	18ms	12532 KiB
		10	Accepted	2/2	20ms	13048 KiB
		11	Accepted	2/2	20ms	13644 KiB
		12	Accepted	2/2	20ms	13828 KiB
		13	Accepted	2/2	26ms	14820 KiB
		14	Accepted	2/2	35ms	16488 KiB
		15	Accepted	2/2	43ms	18492 KiB
		16	Accepted	2/2	61ms	23100 KiB
		17	Accepted	2/2	78ms	28420 KiB
		18	Accepted	2/2	82ms	29724 KiB
		19	Accepted	2/2	89ms	31748 KiB
		20	Accepted	2/2	97ms	33260 KiB
		21	Accepted	2/2	100ms	34256 KiB
		22	Accepted	2/2	101ms	34688 KiB