complete 1932, 2579
This commit is contained in:
1 parent
adbd4d1a3f
commit
02e2f2717d
2 files changed
+24
No files matched your search
@@ -0,0 +1,11 @@
|
||||
N = int(input())
|
||||
|
||||
I = [list(map(int, input().split())) for i in range(N)]
|
||||
T = [[0 for _ in range(i + 1)] for i in range(N)]
|
||||
T[0][0] = I[0][0]
|
||||
|
||||
for i in range(1, N):
|
||||
for j in range(i + 1):
|
||||
T[i][j] = max([T[i - 1][j - 1] if j > 0 else 0, T[i - 1][j] if i > j else 0]) + I[i][j]
|
||||
|
||||
print(max(T[-1]))
|
||||
@@ -0,0 +1,13 @@
|
||||
N = int(input())
|
||||
I = [int(input()) for _ in range(N)]
|
||||
T = [[0 for j in range(3)] for i in range(N)] # T[n][state]
|
||||
T[0][0] = 0
|
||||
T[0][1] = I[0]
|
||||
T[0][2] = I[0]
|
||||
|
||||
for i in range(1, N):
|
||||
T[i][2] = T[i - 1][1] + I[i]
|
||||
T[i][1] = T[i - 1][0] + I[i]
|
||||
T[i][0] = max([T[i - 1][1], T[i - 1][2]])
|
||||
|
||||
print(max(T[N-1][1:]))
|
||||
Reference in new issue
Block a user