Все задачи на 5.10.17 13:00

This commit is contained in:
2017-10-05 13:08:02 +03:00
parent 93746b05d7
commit ca2ca71f63
120 changed files with 2343 additions and 0 deletions

View File

@@ -0,0 +1,18 @@
import sys
problem_name = str('field')
sys.stdin = open(problem_name + ".in", "r")
sys.stdout = open(problem_name+".out", "w")
n, m = map(int, input().split())
a = []
b = [[10**9] * n for i in range(m)]
for i in range(m):
a.append(list(map(int, input().split())))
b[0][0] = 0
for i in range(m):
for j in range(n):
if i - 1 >= 0:
b[i][j] = abs(a[i][j] - a[i - 1][j]) + b[i - 1][j]
if j - 1 >= 0:
b[i][j] = min(b[i][j], b[i][j - 1] + abs(a[i][j] - a[i][j - 1]))
print(b[m - 1][n - 1])