pole = [10,7,5,15,3,8,9,5,10,3]
i = 3
j = 7
sucet = 0
for _ in range(i, j+1): #od i po j (vratane)
#sucet = sucet+pole[_]
sucet += pole[_]
print(sucet)
print(pole[i:j+1]) #suvisla podpostupnost, i <= index < j+1
print(sum(pole[i:j+1])) #spocita sucet podpostupnosti
ps = [0]*len(pole) #prefixove sucty
ps[0] = pole[0]
for k in range(1,len(pole)): #od druhej hodnoty pocitame ako sucet
ps[k] = ps[k-1]+pole[k] #pripocitaj k.-ty prvok pola
print(ps)
#sucet vypocitame ako rozdiel prefixovych suctov po j a po i-1
sucet = ps[j]
if i > 0: #ak nepocitame od zaciatku, tak odpocitaj i-1 hodnot
sucet -= ps[i-1]
print(sucet)
cG9sZSA9IFsxMCw3LDUsMTUsMyw4LDksNSwxMCwzXQoKaSA9IDMKaiA9IDcKCnN1Y2V0ID0gMApmb3IgXyBpbiByYW5nZShpLCBqKzEpOiAjb2QgaSBwbyBqICh2cmF0YW5lKQoJI3N1Y2V0ID0gc3VjZXQrcG9sZVtfXQoJc3VjZXQgKz0gcG9sZVtfXQoJCnByaW50KHN1Y2V0KQoKcHJpbnQocG9sZVtpOmorMV0pICNzdXZpc2xhIHBvZHBvc3R1cG5vc3QsIGkgPD0gaW5kZXggPCBqKzEKCnByaW50KHN1bShwb2xlW2k6aisxXSkpICNzcG9jaXRhIHN1Y2V0IHBvZHBvc3R1cG5vc3RpCgpwcyA9IFswXSpsZW4ocG9sZSkgI3ByZWZpeG92ZSBzdWN0eQpwc1swXSA9IHBvbGVbMF0gCmZvciBrIGluIHJhbmdlKDEsbGVuKHBvbGUpKTogI29kIGRydWhlaiBob2Rub3R5IHBvY2l0YW1lIGFrbyBzdWNldAoJcHNba10gPSBwc1trLTFdK3BvbGVba10gI3ByaXBvY2l0YWogay4tdHkgcHJ2b2sgcG9sYSAKcHJpbnQocHMpCiNzdWNldCB2eXBvY2l0YW1lIGFrbyByb3pkaWVsIHByZWZpeG92eWNoIHN1Y3RvdiBwbyBqIGEgcG8gaS0xCnN1Y2V0ID0gcHNbal0KaWYgaSA+IDA6ICNhayBuZXBvY2l0YW1lIG9kIHphY2lhdGt1LCB0YWsgb2Rwb2NpdGFqIGktMSBob2Rub3QKCXN1Y2V0IC09IHBzW2ktMV0KcHJpbnQoc3VjZXQp
40
[15, 3, 8, 9, 5]
40
[10, 17, 22, 37, 40, 48, 57, 62, 72, 75]
40