-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path18.py
43 lines (41 loc) · 991 Bytes
/
18.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
import time
triugulinik = []
nnn = time.time()
def v_int(straka):
nov = []
for i in straka:
nov.append(int(i))
return nov
f = open("18.txt")
for liniya in f:
chisla_s = liniya.split() # eto razdelyayet po probelam
# teper' chisla_s eto spisok tipa ["1", "3"] ego mozhno perevesti v chisla i ih ispol'zovat'.
triugulinik.append(v_int(chisla_s))
def bl(n):
return [n-1, n]
def slubuiushiia_s(per, vtor):
nov = [0]
nov *= len(vtor)
nov[0] = per[0]+vtor[0]
nov[-1] = per[-1]+vtor[-1]
gde = 0
for i in nov:
if i == 0:
g = bl(gde)
chislo = vtor[gde]
perv = per[g[0]]
vt = per[g[1]]
a = [chislo+perv,chislo+vt]
nov[gde] = max(a)
gde +=1
return nov
k = []
ee = triugulinik[0][0]
per_s = [ee]
for i in triugulinik[1:]:
s = slubuiushiia_s(per_s, i)
print s
k.append(s)
per_s = s
kkk = time.time()
print max(k[-1]),kkk-nnn