input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# coding: utf-8
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^5, 1 <= k <= 100
h = list(map(int, input().rstrip().split()))
dp = [0]
for i in range(1, n):
dp.append(min(dp[j] + abs(h[i] - h[j]) \
for j in range(max(i - k, 0), i)))
print((dp[-1]))
| # coding: utf-8
def f(n, k, h):
dp = [0 for _ in range(n)]
for i in range(1, n):
js = max(i - k, 0)
dp[i] = min(dp[j] + abs(h[i] - h[j]) \
for j in range(js, i))
# print(dp)
return(dp[i])
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^5, 1 <= k <= 100
h = list(map(int, input().rstrip().split()))
print((f(n, k, h)))
| p03161 |
# coding: utf-8
def f(n, k, h):
dp = [float('inf') for _ in range(n)]
dp[0] = 0
for i in range(1, n):
js = max(i - k, 0)
for j in range(js, i):
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]))
return(dp[i])
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^5, 1 <= k <= 100
h = list(map(int, input().rstrip().split()))
print((f(n, k, h)))
| # coding: utf-8
def f(n, k, h):
dp = [float('inf') for _ in range(n)]
dp[0] = 0
for i in range(1, n):
js = max(i - k, 0)
dp[i] = min(dp[j] + abs(h[i] - h[j]) \
for j in range(js, i))
return(dp[i])
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^5, 1 <= k <= 100
h = list(map(int, input().rstrip().split()))
print((f(n, k, h)))
| p03161 |
# coding: utf-8
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^5, 1 <= k <= 100
h = list(map(int, input().rstrip().split()))
dp = [float('inf') for _ in range(n)]
dp[0] = 0
for i in range(1, n):
js = max(i - k, 0)
dp[i] = min(dp[j] + abs(h[i] - h[j]) \
for j in range(js, i))
print((dp[i]))
| # coding: utf-8
import sys
input = sys.stdin.readline
def f(n, k, h):
dp = [0] * n
for i in range(1, n):
js = max(i - k, 0)
dp[i] = min(dp[j] + abs(h[i] - h[j]) \
for j in range(js, i))
return(dp[i])
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^5, 1 <= k <= 100
h = list(map(int, input().rstrip().split()))
print((f(n, k, h)))
| p03161 |
#!/usr/bin/env python3
# vim: set fileencoding=utf-8
# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation
"""Module docstring
"""
import sys
from collections import deque
def solve_samiz(values, nb, max_jump_size):
dp = [10 ** 9] * nb
dp[0] = 0
for i in range(1, nb):
j = max(0, i - max_jump_size)
hi = values[i]
dp[i] = min(dpj + abs(hi - hj) for dpj, hj in zip(dp[j:i], values[j:i]))
return dp[-1]
def solve(values, nb, max_jump_size):
max_jump_size = min(nb, max_jump_size)
cost_to = [0]
for i in range(1, nb):
j = min(i, max_jump_size)
value_i = values[i]
new_cost = min(
cost_to[i - k] + abs(value_i - values[i - k]) for k in range(1, j + 1)
)
cost_to.append(new_cost)
return new_cost
def do_job():
"Do the work"
# first line is number of test cases
N, K = list(map(int, input().split()))
values = list(map(int, input().split()))
result = solve(values, N, K)
print(result)
def print_output(testcase, result) -> None:
"Formats and print result"
if result is None:
result = "IMPOSSIBLE"
print(("Case #{}: {}".format(testcase + 1, result)))
def main(argv=None):
"Program wrapper."
if argv is None:
argv = sys.argv[1:]
do_job()
return 0
if __name__ == "__main__":
import doctest
doctest.testmod()
sys.exit(main())
| #!/usr/bin/env python3
# vim: set fileencoding=utf-8
# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation
"""Module docstring
"""
import sys
def solve(values, nb, max_jump_size):
max_jump_size = min(nb, max_jump_size)
cost_to = [0]
for i in range(1, nb):
j = max(0, i - max_jump_size)
value_i = values[i]
new_cost = min(
prev_cost + abs(value_i - prev_value)
for prev_cost, prev_value in zip(cost_to[j:i], values[j:i])
)
cost_to.append(new_cost)
return new_cost
def do_job():
"Do the work"
# first line is number of test cases
N, K = list(map(int, input().split()))
values = list(map(int, input().split()))
result = solve(values, N, K)
print(result)
def print_output(testcase, result) -> None:
"Formats and print result"
if result is None:
result = "IMPOSSIBLE"
print(("Case #{}: {}".format(testcase + 1, result)))
def main(argv=None):
"Program wrapper."
if argv is None:
argv = sys.argv[1:]
do_job()
return 0
if __name__ == "__main__":
import doctest
doctest.testmod()
sys.exit(main())
| p03161 |
N,k = list(map(int,input().split()))
l = list(map(int,input().split()))
cost = [0] * N
for i in range(N):
temp = []
for j in range(max(0,i-k),i):
delta = cost[j]+abs(l[i]-l[j])
temp.append(delta)
cost[i] = min(temp)
print((cost[N-1])) | N,k = list(map(int,input().split()))
l = list(map(int,input().split()))
cost = [0] * N
for i in range(1,N):
temp = []
cost[i] = min([cost[j]+abs(l[i]-l[j]) for j in range(max(0,i-k),i)])
print((cost[N-1])) | p03161 |
#import numpy
[n,k] = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
dp = [0]
i_ls = []
now = 0
#dpのi番目の要素がi+1番目の足場までの最小コスト
for i in range(1,n):
#i番目の足場
if i < k:
for j in range(i):
i_ls.append(abs(a[i]-a[j])+dp[j])
#print("i<k")
else:
for j in range(i-k,i):
i_ls.append(abs(a[i]-a[j])+dp[j])
#print("i>=k")
dp.append(min(i_ls))
#print(i_ls)
i_ls = []
print((dp[n-1]))
| [n,k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
"""
初期条件
dp[0] = 0
dp[1] = h[1] - h[0]
"""
dp = [10 ** 9 + 7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n > 2:
for i in range(2,n):
for j in range(1,min(i - 0,k)+1):
dp[i] =min(dp[i - j] + abs(h[i]-h[i - j]),dp[i])
print((dp[n-1]))
else:
print((dp[1]))
| p03161 |
[n,k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
"""
初期条件
dp[0] = 0
dp[1] = h[1] - h[0]
"""
dp = [10 ** 9 + 7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n > 2:
for i in range(2,n):
for j in range(1,min(i - 0,k)+1):
dp[i] =min(dp[i - j] + abs(h[i]-h[i - j]),dp[i])
print((dp[n-1]))
else:
print((dp[1]))
| [n,k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
dp = [1000000000] * n
dp[0] = 0
for i in range(1,n):
for j in range(1,min(k,i)+1):
dp[i] = min(dp[i],dp[i-j] + abs(h[i] - h[i-j]))
print((dp[n-1]))
#print(dp)
| p03161 |
import math
import sys
input = sys.stdin.readline
number, jump =input().rstrip().split()
number = int(number)
jump = int(jump)
scaffolding = input().rstrip().split()
scaffolding = list(map(int, scaffolding))
res = [math.inf for i in range(number)]
res[0] =0
test = [math.inf for k in range(jump)]
test[0] = 0
for i in range(number):
for j in range(1,jump+1):
if i-j < 0:break
cost = abs(scaffolding[i]-scaffolding[i-j])
test[j-1] = res[i-j] + cost
res[i] = min(test)
print((res[number-1]))
| import math
import sys
input = sys.stdin.readline
number, jump =input().rstrip().split()
number = int(number)
jump = int(jump)
scaffolding = input().rstrip().split()
scaffolding = list(map(int, scaffolding))
res = [0 for i in range(number)]
res[1] = abs(scaffolding[1]-scaffolding[0])
#test = [math.inf for k in range(jump)]
#test[0] = 0
for i in range(2, number):
h=max(0,i-jump)
res[i]=min(res[k]+abs(scaffolding[i]-scaffolding[k]) for k in range(h,i))
#res[i] = min(test)
print((res[number-1])) | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int,input().split()))
if k > n:
k = n-1
'''
n番目の場所に到達する時
n-1番目から、1つ飛んでくる
n-2番目から、２つ飛んでくる
...
n-K番目から、kつ飛んでくる
可能性がある その時の最小値を考える
初期条件
dp[0] = 0
dp[1~Kまで]を計算
*** n-j
dp[n] = dp[n-j] + abs(h[n] - h[n-j])
漸化式
n >= 2
dp[n] = min(jump_list)
1~K
jump_list = [1 ~ j で dp[n] = dp[n-j] + abs(h[n] - h[n-j])]
k~N
jump_list = [1 ~ k で dp[n] = dp[n-j] + abs(h[n] - h[n-j])]
'''
#初期値
dp = [0]
def create_jump_list(j,i):
alist = []
for x in range(j, i):
alist.append(
dp[x] + abs(h[i] - h[x])
)
return alist
# kまで
for i in range(1, k+1):
jump_list = create_jump_list(0,i)
dp.append(
min(jump_list)
)
for i in range(k+1,n):
jump_list = create_jump_list(i-k, i)
dp.append(
min(jump_list)
)
#print(dp)
print((dp[n-1]))
| n, k = list(map(int, input().split()))
h = list(map(int,input().split()))
if k > n:
k = n-1
'''
n番目の場所に到達する時
n-1番目から、1つ飛んでくる
n-2番目から、２つ飛んでくる
...
n-K番目から、kつ飛んでくる
可能性がある その時の最小値を考える
初期条件
dp[0] = 0
dp[1~Kまで]を計算
*** n-j
dp[n] = dp[n-j] + abs(h[n] - h[n-j])
漸化式
n >= 2
dp[n] = min(jump_list)
1~K
jump_list = [1 ~ j で dp[n] = dp[n-j] + abs(h[n] - h[n-j])]
k~N
jump_list = [j-k ~ j で dp[n] = dp[n-j] + abs(h[n] - h[n-j])]
'''
#初期値
dp = [0]
def create_jump_list(j,i):
alist = []
for x in range(j, i):
alist.append(
dp[x] + abs(h[i] - h[x])
)
return alist
# kまで
for i in range(1, k+1):
jump_list = create_jump_list(0,i)
dp.append(
min(jump_list)
)
for i in range(k+1,n):
jump_list = create_jump_list(i-k, i)
dp.append(
min(jump_list)
)
print((dp[n-1]))
| p03161 |
size, jumps = list(map(int, input().split()))
array = list(map(int, input().split()))
dp = [999999999] * size
dp[0]= 0
dp[1] = abs(array[0]- array[1])
for i in range(2,size):
dp[i] = min(abs(array[i] - array[j]) + dp[j] for j in range(max(0, i - jumps), i))
print((dp[size-1])) | import sys
def input():
return sys.stdin.readline().strip()
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * n
dp[0] = 0
dp[1] = abs(h[0] - h[1])
for i in range(2, n):
dp[i] = min(abs(h[i] - h[j]) + dp[j] for j in range(max(0, i - k), i))
print((dp[n - 1]))
if __name__ == "__main__":
main()
| p03161 |
N,K = list(map(int,input().split(" ")))
H = list(map(int,input().split(" ")))
#DPテーブル作成
dp = [10**10]*(len(H)+K)
dp[0]=0
for i in range(N):
for j in range(1,K+1):
if(i+j<N):
dp[i+j]=min(dp[i+j],dp[i]+abs(H[i]-H[i+j]))
print((dp[N-1]))
#print(dp) | N,K = list(map(int,input().split(" ")))
H = list(map(int,input().split(" ")))
#DPテーブル作成
dp = [10**10]*(N)
dp[0]=0
for i,hi in enumerate(H):
if i ==0:
continue
s = i-K if i-K>=0 else 0
dp[i] = min([dpk+abs(hi-hk) for dpk,hk in zip(dp[s:i],H[s:i])])
print((dp[-1]))
#print(dp) | p03161 |
n, k = [int(e) for e in input().split()]
h = [int(e) for e in input().split()]
cost = [0] * n
for i in range(1, n):
cost[i] = min(abs(h[i] - h[j]) + cost[j] for j in range(max(0, i - k), i))
print((cost[n - 1]))
| def main():
n, k = [int(e) for e in input().split()]
h = [int(e) for e in input().split()]
cost = [0] * n
for i in range(1, n):
cost[i] = min(abs(h[i] - h[j]) + cost[j] for j in range(max(0, i - k), i))
print((cost[n - 1]))
main()
| p03161 |
# DP(貰うDP)
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[N - 1]))
main()
| # DP(貰うDP)
def main():
from builtins import abs
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[N - 1]))
main()
| p03161 |
# DP(貰うDP)
def main():
from builtins import abs, max, min, range
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[N - 1]))
main()
| def main():
from builtins import abs
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[N - 1]))
main()
| p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
s = 10**10
for j in range(1,min(i,K)+1):
s = min(s,dp[i-j]+abs(h[i]-h[i-j]))
dp[i] = s
print((dp[N-1])) | N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
DP = [0]
for i in range(1,N):
a = DP[i-1] + abs(H[i]-H[i-1])
for j in range(2,min(K,i)+1):
b = DP[i-j] + abs(H[i]-H[i-j])
a = min(a,b)
DP.append(a)
print((DP[N-1])) | p03161 |
N, K = list(map(int, input().split()))
H = [0] + list(map(int, input().split()))
DP = [0] * (N+1)
for i in range(2, N+1):
k = min(i, K+1)
DP[i] = min(DP[i-j] + abs(H[i-j] - H[i]) for j in range(1, k))
print((DP[N]))
| N, K = list(map(int, input().split()))
H = [0] + list(map(int, input().split()))
DP = [0] * (N+1)
for i in range(2, N+1):
k = max(i-K, 1)
DP[i] = min(dp + abs(h - H[i]) for dp, h in zip(DP[k:i], H[k:i]))
print((DP[N]))
| p03161 |
n, k = list(map(int, input().split()))
k = min(n - 1, k)
h = list(map(int, input().split()))
cost = [0 for _ in range(k)]
for i, hi in enumerate(h):
if i == 0: continue
(cs, hs) = (k - i, 0) if k > i else (0, i - k)
new_cost = min([ck + abs(hi - hk) for ck, hk in zip(cost[cs:], h[hs:])])
cost = cost[1:] + [new_cost]
print((cost[k - 1]))
| n, k = list(map(int, input().split()))
k = min(n - 1, k)
h = list(map(int, input().split()))
cost = [0 for _ in range(n)]
for i, hi in enumerate(h):
if i == 0: continue
st = i - k if i > k else 0
cost[i] = min([ck + abs(hi - hk) for ck, hk in zip(cost[st:i], h[st:i])])
print((cost[-1]))
| p03161 |
# Problem A - Frog 2 - Algoritmos e Grafos - MATA52
def frog2(n, h, k_max):
global stones
stones[0] = 0
stones[1] = abs(h[1] - h[0])
for i in range(2, n):
for j in range(1, min(i, k_max) + 1):
w1 = stones[i]
w2 = abs(h[i - j] - h[i])
stones[i] = min(w1, stones[i - j] + w2)
return stones[n - 1]
n, k_max = list(map(int, input().split()))
h = list(map(int, input().split()))
stones = [float("inf")] * n
print((frog2(n, h, k_max))) | def woo(x, y):
res = [0]*x
z = list(map(int, input().split()))
for i in range(1, x):
res[i] = min(abs(z[i] - z[j]) + res[j] for j in range(max(0, i - y), i))
return res
if __name__ == '__main__':
x, y = list(map(int, input().split()))
r = woo(x, y)
f = len(r)-1
print((r[f]))
| p03161 |
def woo(x, y):
res = [0]*x
z = list(map(int, input().split()))
for i in range(1, x):
res[i] = min(abs(z[i] - z[j]) + res[j] for j in range(max(0, i - y), i))
return res
if __name__ == '__main__':
x, y = list(map(int, input().split()))
r = woo(x, y)
f = len(r)-1
print((r[f]))
| def main():
n, k = tuple([int(e) for e in input().split()])
arr = [int(e) for e in input().split()]
t = [float('inf')] * (n + 1)
t[0] = 0
t[1] = 0
for i in range(2, n + 1):
for j in range(1, k + 1):
if i - j <= 0:
break
l1 = t[i - j] + abs(arr[i - j - 1] - arr[i - 1])
t[i] = min(t[i], l1)
print((t[n]))
return 0
if __name__ == '__main__':
main() | p03161 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0] * n
t = []
for i in range(1,n):
for l in range(1,k+1):
if i - l >= 0:
t.append(abs(h[i] - h[i-l]) + dp[i-l])
else:
break
dp[i] = min(t)
t.clear()
print((dp[-1]))
#実行制限時間2秒以内に間に合わない | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0] * n
t = []
for i in range(1,n):
for l in range(1,k+1):
if i - l >= 0:
t.append(abs(h[i] - h[i-l]) + dp[i-l])
else:
break
dp[i] = min(t)
t.clear()
print((dp[-1])) | p03161 |
def main2(N,h,K):
inf = 2**31 -1
dp = [inf] * N
dp[0] = 0
for i in range(1, N):
for k in range(1, K+1):
if i-k >= 0:
dp[i] = min(dp[i], dp[i-k] + abs(h[i-k] - h[i]))
else:
break
return dp[N-1]
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
print((main2(N,h,K))) | def main2(N,h,K):
dp = [0] * N
for i in range(1,N):
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(max(0, i-K), i)])
return dp[-1]
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
print((main2(N,h,K)))
| p03161 |
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(10 ** 7)
def resolve():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10 ** 6
memo = [inf for _ in range(n)]
memo[0] = 0
for kk in range(1, min(k, n - 1) + 1):
memo[kk] = abs(h[kk] - h[0])
def dp(n):
if n == 0:
return 0
elif memo[n] != inf:
return memo[n]
else:
memo[n] = min([dp(n - kk) + abs(h[n] - h[n - kk]) for kk in range(1, k + 1)])
return memo[n]
print((dp(n - 1)))
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """5 3
10 30 40 50 20"""
output = """30"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """3 1
10 20 10"""
output = """20"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """2 100
10 10"""
output = """0"""
self.assertIO(input, output)
def test_入力例_4(self):
input = """10 4
40 10 20 70 80 10 20 70 80 60"""
output = """40"""
self.assertIO(input, output)
if __name__ == "__main__":
# unittest.main()
resolve()
| import sys
from io import StringIO
import unittest
sys.setrecursionlimit(10 ** 7)
def resolve():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10 ** 9
# memo = [inf for _ in range(n)]
# memo[0] = 0
# for kk in range(1, min(k, n - 1) + 1):
# memo[kk] = abs(h[kk] - h[0])
#
# def dp(n):
# if n == 0:
# return 0
# elif memo[n] != inf:
# return memo[n]
# else:
# memo[n] = min([dp(n - kk) + abs(h[n] - h[n - kk]) for kk in range(1, k + 1)])
# return memo[n]
#
# print(dp(n - 1))
ans = [inf for _ in range(n)]
ans[0] = 0
if n < k:
k = n - 1
for kk in range(1, k + 1):
ans[kk] = abs(h[kk] - h[0])
for i in range(1, n):
for kk in range(1, k + 1):
if i + kk < n:
ans[i + kk] = min(ans[i + kk], ans[i] + abs(h[i + kk] - h[i]))
print((ans[-1]))
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """5 3
10 30 40 50 20"""
output = """30"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """3 1
10 20 10"""
output = """20"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """2 100
10 10"""
output = """0"""
self.assertIO(input, output)
def test_入力例_4(self):
input = """10 4
40 10 20 70 80 10 20 70 80 60"""
output = """40"""
self.assertIO(input, output)
if __name__ == "__main__":
# unittest.main()
resolve()
| p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0]*n
for i in list(range(n))[1:]:
dp[i] = min([dp[j]+abs(h[i]-h[j]) for j in [max(0, i-ki-1) for ki in range(k)]])
print((dp[-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0]*n
for i in list(range(n))[1:]:
tmp = max(0, i-k)
dp[i] = min([dpk+abs(h[i]-hk) for dpk, hk in zip(dp[tmp:i], h[tmp:i])])
print((dp[-1])) | p03161 |
import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [float('inf')]*n
dp[0] = 0
for i in range(n):
for j in range(1,k+1):
if i-j >= 0:
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1]))
| import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [10**9]*n
dp[0] = 0
for i in range(n):
for j in range(1,k+1):
if i-j >= 0:
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1]))
| p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
dp[i]=min([dp[j] + abs(h[i]-h[j]) for j in range(max(i-k,0),i)])
print((dp[-1]))
| n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*n
def calc(n,k,h,dp):
for i in range(1,n):
dp[i]=min([dp[j] + abs(h[i]-h[j]) for j in range(max(i-k,0),i)])
calc(n,k,h,dp)
print((dp[-1]))
| p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
h+=[0]*k
inf=float('inf')
dp=[inf]*(n+k)
dp[0]=0
for i in range(n):
for j in range(1,k+1):
dp[i+j]=min(dp[i]+abs(h[i]-h[i+j]),dp[i+j])
print((dp[n-1]))
| n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[float("inf")]*n
dp[0]=0
for i in range(1,n):
for j in range(max(0,i-k),i):
dp[i]=min(dp[i],dp[j]+abs(h[i]-h[j]))
print((dp[n-1]))
| p03161 |
import sys
def mincost(n,h):
dp=[-1 for i in range(n)]
dp[n-1]=0
dp[n-2]=abs(h[n-2]-h[n-1])
for i in range(n-3,-1,-1):
mn=min(i+k+1,n)
mnm=sys.maxsize
for j in range(i+1,mn):
mnm=min(dp[j]+abs(h[j]-h[i]),mnm)
dp[i]=mnm
return dp[0]
n,k=list(map(int,input().split()))
h=[int(x) for x in input().split()]
print((mincost(n,h))) | from sys import stdin, gettrace
import sys
if not gettrace():
def input():
return next(stdin)[:-1]
# def input():
# return stdin.buffer.readline()
def mincost(n,h,k):
dp=[-1 for i in range(n)]
dp[n-1]=0
dp[n-2]=abs(h[n-2]-h[n-1])
for i in range(n-3,-1,-1):
mn=min(i+k+1,n)
mnm=sys.maxsize
for j in range(i+1,mn):
mnm=min(dp[j]+abs(h[j]-h[i]),mnm)
dp[i]=mnm
return dp[0]
def main():
n,k=list(map(int,input().split()))
h=[int(x) for x in input().split()]
print((mincost(n,h,k)))
if __name__ == "__main__":
main() | p03161 |
n,k = list(map(int,input().split()))
lst1 = list(map(int,input().split()))
dp = [float("inf") for _ in range(n)]
dp[0] = 0
for i in range(1,n):
for j in range(max(0,i-k),i):
dp[i] = min(dp[i],dp[j]+abs(lst1[i]-lst1[j]))
print((dp[-1])) | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,k = list(map(int,readline().split()))
lst1 = list(map(int,readline().split()))
dp = [10**10 for _ in range(n)]
dp[0] = 0
for i in range(1,n):
for j in range(1,k+1):
if i-j < 0:
break
dp[i] = min(dp[i],dp[i-j]+abs(lst1[i-j]-lst1[i]))
print((dp[-1]))
| p03161 |
n, k, *h = list(map(int, open(0).read().split()))
h += [0] * 200
dp = [0] + [float("inf")] * 100200
for i in range(1, n):
dp[i] = min(dp[i-a] + abs(h[i] - h[i-a]) for a in range(1, k + 1))
print((dp[n - 1])) | n, k, *h = list(map(int, open(0).read().split()))
dp = [0] * n
for i in range(1, n):
dp[i] = min(dp[i-a] + abs(h[i] - h[i-a]) for a in range(1, min(i, k) + 1))
print((dp[n - 1])) | p03161 |
n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[-1]*n
dp[0]=0
if n<=x:
x=n-1
for i in range(1,x+1):
dp[i]=abs(a[i]-a[0])
for i in range(x+1,n):
min1=10**9
for j in range(i-(x),i):
if min1>dp[j]+abs(a[j]-a[i]):
min1=dp[j]+abs(a[j]-a[i])
dp[i]=min1
print((dp[-1]))
| n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
if n<=x:#ｎこのDPを作りたいのでｘが超えたらそれを変える必要がある
x=n-1#でもこれは実際甘え
dp=[-1]*n
dp[0]=0#さいしょのところは０かかる
for i in range(1,x+1):#飛べる距離までとべるところから最初の値を引く
dp[i]=abs(a[i]-a[0])
for i in range(x+1,n):#さいしょのいちから飛べないところからDPを入れる
min1=10**9
for j in range(i-(x),i): # 最小を調べる繰り返し
if min1>dp[j]+abs(a[j]-a[i]):
min1=dp[j]+abs(a[j]-a[i])#Xの数最小の値を調べる
dp[i]=min1
print((dp[-1])) | p03161 |
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
h = [int(x) for x in input().split()]
dp = [0] * N
for i, hi in enumerate(h):
if i == 0:
continue
if i - K < 0:
dp[i] = min(dpk + abs(hi-hk) for dpk, hk in zip(dp[:i], h[:i]))
else:
dp[i] = min(dpk + abs(hi-hk) for dpk, hk in zip(dp[i-K:i], h[i-K:i]))
print((dp[-1])) | N, K = list(map(int, input().split()))
h = [int(_) for _ in input().split()]
dp = [float('inf')]*(N)
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2, N):
for j in range(1, K+1):
if i >= j:
dp[i] = min(dp[i-j]+abs(h[i]-h[i-j]), dp[i])
print((dp[N-1])) | p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
dp[i]=min(dp[j]+abs(h[i]-h[j]) for j in range(max(i-k,0),i))
print((dp[n-1])) | def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp=[0]*N
for i in range(1,N):
dp[i] = min(dp[g] + abs(h[i] - h[g]) for g in range(max(i-K,0), i))
print((dp[N-1]))
main()
| p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
c = [0 for i in range(n)]
for i in range(1, n):
l = max(0, i-k)
c[i] = min([c[x] + abs(h[x] - h[i]) for x in range(l, i)])
print((c[n-1]))
| n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
c = [0 for i in range(n)]
for i in range(1, n):
l = max(0, i-k)
c[i] = min(cj + abs(hj - h[i]) for hj, cj in zip(h[l:i], c[l:i]))
print((c[n-1]))
| p03161 |
import sys
import math
from collections import deque
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [[10**9 for _ in range(K+1)] for _ in range(N)]
dp[0] = [0 for _ in range(K+1)]
for i in range(N):
for l in range(K):
if i-(l+1) >= 0:
dp[i][l] = dp[i - (l + 1)][K] + abs(h[i] - h[i - (l + 1)])
else:
dp[i][l] = min(dp[i])
if l == K-1:
dp[i][K] = min(dp[i])
print((min(dp[N-1]))) | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [[10**9 for _ in range(K+1)] for _ in range(N)]
dp[0] = [0 for _ in range(K+1)]
for i in range(N):
for l in range(K):
if i-(l+1) >= 0:
dp[i][l] = dp[i - (l + 1)][K] + abs(h[i] - h[i - (l + 1)])
else:
dp[i][l] = min(dp[i])
if l == K-1:
dp[i][K] = min(dp[i])
print((min(dp[N-1]))) | p03161 |
#
n, k=list(map(int, input().split()))
a=list(map(int, input().split()))
if n<3:
print((abs(a[0]-a[-1])))
exit()
c=[0]*n
c[-1]=0
mini=1000000
for i in reversed(list(range(n-k, n-1))):
# print(i)
c[i]=abs(a[i]-a[n-1])
mini=min(mini, c[i])
for i in reversed(list(range(n-k))):
c[i]=min([c[t]+abs(a[i]-a[t]) for t in range(i+1, i+k+1)])
# print("?", c)
print((c[0])) | n, k=list(map(int, input().split()))
a=list(map(int, input().split()))
if n<3:
print((abs(a[0]-a[-1])))
exit()
c=[0]*n
c[-1]=0
mini=1000000
for i in reversed(list(range(n-k, n-1))):
# print(i)
c[i]=abs(a[i]-a[n-1])
mini=min(mini, c[i])
for i in reversed(list(range(n-k))):
c[i]=min([c[t]+abs(a[i]-a[t]) for t in range(i+1, i+k+1)])
# print("?", c)
print((c[0])) | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10000000000
dp = [inf] * N
dp[0] = 0
for i in range(1, N):
#mindp_i = inf
for jump in range(1, K + 1):
if i - jump >= 0:
dp[i] = min(dp[i], dp[i - jump] + abs(h[i] - h[i - jump]))
#dpcand = dp[i - jump] + abs(h[i] - h[i - jump])
#print(dpcand)
#if dpcand < mindp_i:
# mindp_i = dpcand
#dp[i] = mindp_i
print((dp[N-1])) | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = float('inf')
dp = [inf] * N
dp[0] = 0
for i in range(1, N):
mindp_i = inf
for jump in range(1, K + 1):
if i - jump >= 0:
dpcand = dp[i - jump] + abs(h[i] - h[i - jump])
#print(dpcand)
if dpcand < mindp_i:
mindp_i = dpcand
dp[i] = mindp_i
print((dp[N-1])) | p03161 |
def main(): #グローバル名前空間で大きな処理を書かない
n,k=list(map(int,input().split()))
H=["dammy"]+list(map(int,input().split()))
dp=[0]*(n+1)
for i in range(2,min(k+2,n+1)):
dp[i]=min(dp[j]+abs(H[i]-H[j]) for j in range(1,i))
for i in range(k+2,n+1):
dp[i] = min(dp[i-j]+abs(H[i]-H[i-j]) for j in range(1,k+1)) #TLEになる.
print((dp[n]))
if __name__ == '__main__':
main() | def main():
n, k = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0] * n
for i, Hi in enumerate(H):
if i == 0:
continue
s = max(0, i-k) # iがk以下かどうかで処理が変わる.
dp[i] = min([dl + abs(hl - Hi) for dl, hl in zip(dp[s:i], H[s:i])])
print((dp[-1]))
main() | p03161 |
n,k= list(map(int,input().split()))
h = [int(i) for i in input().split()]
inf = 10**7
dp = [inf]*100005
dp[0] = 0
for i in range(1,n):
dp[i] = min(dp[i-j] + abs(h[i-j] - h[i]) for j in range(1,min(k,i)+1))
print((dp[n-1])) | def main():
n,k= list(map(int,input().split()))
h = [int(i) for i in input().split()]
inf = 10**7
dp = [inf]*100005
dp[0] = 0
for i in range(1,n):
dp[i] = min(dp[i-j] + abs(h[i-j] - h[i]) for j in range(1,min(k,i)+1))
print((dp[n-1]))
main() | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
DP = [0]
for i in range(N-1):
act = float("inf")
for k in range(K):
if i-k < 0 : continue
act = min(DP[-1-k] + abs(h[i-k]-h[i+1]) , act)
DP += [act]
print((DP[-1])) | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0]
for i in range(n-1):
cnt = float("inf")
for j in range(k):
if i-j < 0: continue
cnt = min(dp[-1-j] + abs(h[i-j]-h[i+1]), cnt)
#print("i =",i,"j =",j,"i-j =",i-j,"i+j =",i+j,"cnt =",cnt)
dp.append(cnt)
print((dp[-1])) | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")]*(N + 2)
dp[0] = 0
for i in range(N):
for k in range(1, K + 1):
if i < N - k:
dp[i + k] = min(dp[i + k], abs(h[i] - h[i + k]) + dp[i])
print((dp[N - 1]))
| N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")]*(N + 2)
dp[0] = 0
for i in range(N):
for k in range(1, min(K + 1, N - i)):
dp[i + k] = min(dp[i + k], abs(h[i] - h[i + k]) + dp[i])
print((dp[N - 1]))
| p03161 |
import sys
sys.setrecursionlimit(10**7)
n,k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
INF = 10 ** 9
memo = [-1]*n
memo[0] = 0
def dp(i):
if (memo[i] != -1):
return memo[i]
ans = INF
for j in range (max(0, i-k),i):
ans = min(ans, dp(j) + abs(h[i] - h[j]))
memo[i] = ans
return memo[i]
print((dp(n-1)))
| import sys
sys.setrecursionlimit(10**7)
n,k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
memo = [0]*n
for i in range(1, n):
min_k = float('inf')
min_k=min([memo[j] +abs(h[i]-h[j]) for j in range(max(0, i-k), i)])
memo[i] = min_k
print((memo[-1]))
| p03161 |
import sys
n, K = list(map(int, sys.stdin.readline().split()))
H = list(map(int, sys.stdin.readline().split()))
p = [float('inf') for _ in range(n)]
p[0] = 0
for i in range(1, n):
for k in range(1, K+1):
if i-k >=0:
tmp = abs(H[i]-H[i-k]) + p[i-k]
if p[i] > tmp:
p[i] = tmp
print((p[-1])) | #EDP-B
import sys
n, K = list(map(int, sys.stdin.readline().split()))
H = list(map(int, sys.stdin.readline().split()))
dp = [0 for i in range(n)]
#初期条件
for i in range(1, n):
dp[i] = abs(H[i]-H[i-1]) + dp[i-1]
#print(dp)
for i in range(2, n):
for k in range(1, K+1):
if i-k>=0:
dp[i] = min(dp[i], abs(H[i]-H[i-k]) + dp[i-k])
#print(dp, i, k)
print((dp[-1])) | p03161 |
#DP B
import sys
N, K = list(map(int, sys.stdin.readline().split()))
H = list(map(int, sys.stdin.readline().split()))
dp = [0 for _ in range(N)]
#print(dp)
#print(H)
dp[1] = abs(H[1]-H[0])
#print(dp)
for i in range(2, N):
for k in range(1, K+1):
if i-k>=0:
tmp = abs(H[i]-H[i-k]) + dp[i-k]
if dp[i] ==0 or tmp < dp[i]:
dp[i] = tmp
#print(dp)
print((dp[-1])) | #DP B
import sys
N, K = list(map(int, sys.stdin.readline().split()))
H = list(map(int, sys.stdin.readline().split()))
dp = [-1 for _ in range(N)]
#print(dp)
#print(H)
dp[0] = 0
#print(dp)
for i in range(1, N):
for k in range(1, K+1):
if i-k>=0:
tmp = abs(H[i]-H[i-k]) + dp[i-k]
if dp[i] ==-1 or tmp < dp[i]:
dp[i] = tmp
#print(dp)
print((dp[-1])) | p03161 |
# https://atcoder.jp/contests/dp/tasks/dp_b
# B - Frog 2
N, K = list(map(int, input().strip().split(' ')))
H = list(map(int, input().strip().split(' ')))
dp = [0] * N
for i in range(1, N):
MIN = None
for j in range(1, K + 1):
if i - j < 0:
continue
if MIN == None:
MIN = dp[i - j] + abs(H[i] - H[i - j])
else:
MIN = min(dp[i - j] + abs(H[i] - H[i - j]), MIN)
dp[i] = MIN
print((dp[-1]))
| N,K=list(map(int,input().strip().split(" ")))
H=list(map(int,input().strip().split(" ")))
dp=[0]+[10**10]*(N-1)
for i in range(1,N):
temp=0
for j in range(i-K,i):
if j>=0:
dp[i]=min(dp[i],dp[j]+abs(H[i]-H[j]))
print((dp[-1]))
| p03161 |
import sys
#import numpy as np
#from collections import defaultdict
import math
#from collections import deque
input = sys.stdin.readline
def main():
N ,K= list(map(int,input().split()))
H = list(map(int,input().split()))
H = [0] + H
dp= [0] *(N+1)
dp = [10**5] * (N + 1)
dp[1] = 0
for i in range(2, N + 1):
way =[10**10]*(K+2)
for j in range(1, K+1):
if j<i:
way[j]=(dp[i-j]+abs(H[i]-H[i-j]))
dp[i] = min(way)
print((dp[N]))
if __name__ == "__main__":
main() | import sys
#import numpy as np
#from collections import defaultdict
#import math
#from collections import deque
input = sys.stdin.readline
def main():
N ,K= list(map(int,input().split()))
H = list(map(int,input().split()))
H = [0] + H
dp= [0] *(N+1)
dp = [10**5] * (N + 1)
dp[1] = 0
for i in range(2, N + 1):
way =[10**10]*(K+2)
for j in range(1, K+1):
if j<i:
way[j]=(dp[i-j]+abs(H[i]-H[i-j]))
dp[i] = min(way)
print((dp[N]))
if __name__ == "__main__":
main() | p03161 |
N, K = list(map(int, input().split()))
h = [0] + list(map(int, input().split()))
dp = [10**10 for i in range(N+1)]
dp[0] = dp[1] = 0
for i in range(1, N+1):
for k in range(1, K+1):
if i + k <= N:
dp[i+k] = min(dp[i+k], dp[i]+abs(h[i] - h[i+k]))
print((dp[N])) | N, K = list(map(int, input().split()))
h = [0] + list(map(int, input().split()))
dp = [10**10] * (N+1)
dp[0] = dp[1] = 0
for i in range(1, N+1):
for k in range(1, K+1):
if i + k <= N:
dp[i+k] = min(dp[i+k], dp[i]+abs(h[i] - h[i+k]))
print((dp[N])) | p03161 |
# B - Frog 2
import sys
sys.setrecursionlimit(10**6)
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
# 無限大の値
INF = 10**10
# DP テーブル
dp = [0]*(100010)
# DP テーブル全体を初期化
for i in range(100010):
dp[i] = INF
# 初期条件
def rec(v):
# DP の値が既に更新されていたらそのままリターン
if dp[v] < INF:
return dp[v]
if v == 0:
dp[0] = 0
return 0
res = INF
for k in range(1,K+1):
# 遷移元の足場がないとき
if v-k < 0:
continue
# 足場 v-k から足場 v に移動する
res = min(res, rec(v-k) + abs(h[v]-h[v-k]))
# 結果をメモして返す
dp[v] = res
return res
print((rec(N-1))) | # B - Frog 2
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
# 無限大の値
INF = 10**10
# DP テーブル
dp = [0]*(100010)
# DP テーブル全体を初期化
for i in range(100010):
dp[i] = INF
# 初期条件
dp[0] = 0
for v in range(1,N):
for k in range(1,K+1):
# 遷移元の足場がないとき
if v-k < 0:
continue
# 足場 v-k から足場 v に移動する
dp[v] = min(dp[v], dp[v-k] + abs(h[v]-h[v-k]))
print((dp[N-1])) | p03161 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
final=[0]*n
if k>=n:
print((abs(l[n-1]-l[0])))
else:
for i in range(1,k+1):
final[i]=abs(l[i]-l[0])
for i in range(k+1,n):
mini=10**9+1
x=k
for j in range(1,x+1):
mini=min(mini,final[i-j]+abs(l[i]-l[i-j]))
final[i]=mini
print((final[-1]))
| n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
final=[0]*n
if k>=n:
print((abs(l[n-1]-l[0])))
else:
for i in range(1,k+1):
final[i]=abs(l[i]-l[0])
for i in range(k+1,n):
li=[abs(l[i]-l[ik])+final[ik] for ik in range(i-1,i-k-1,-1) ]
final[i]=min(li)
print((final[-1]))
| p03161 |
import sys
input = sys.stdin.readline
N,K=(int(i) for i in input().split())
h = [int(i) for i in input().split()]
c = [0]*N
for i in range(1,N):
jumpmax = min(i,K)
c[i] = min([abs(h[i]-h[i-j])+c[i-j] for j in range(1,jumpmax+1)])
print((c[N-1])) | N,K=(int(i) for i in input().split())
h = [int(i) for i in input().split()]
c = [0]*N
for i in range(1,N):
jumpmax = min(i,K)
c[i] = min([abs(h[i]-h[i-j])+c[i-j] for j in range(1,jumpmax+1)])
print((c[N-1])) | p03161 |
#atcoder https://atcoder.jp/contests/dp/tasks/dp_b
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(
dp[k] + abs(h[i]-h[k]) for k in range(max(i-K,0), i)
)
print((dp[N-1]))
| #atcoder https://atcoder.jp/contests/dp/tasks/dp_b
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(
dp[k] + abs(h[i]-h[k]) for k in range(max(i-K,0), i)
)
print((dp[N-1]))
main() | p03161 |
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
ans=[0]*N
ans[1]=abs(h[1]-h[0])
for i in range(2,N):
ans[i] = min(abs(h[i] - h[j]) + ans[j] for j in range(max(0,i-K),i))
print((ans[N-1])) | def main():
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
ans=[0]*N
ans[1]=abs(h[1]-h[0])
for i in range(2,N):
ans[i] = min(abs(h[i] - h[j]) + ans[j] for j in range(max(0,i-K),i))
print((ans[N-1]))
main() | p03161 |
def main():
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
# 初期化
# 初期条件
# ループ
# テーブルから解を得る
INF = float('inf')
dp = [INF] * N
dp[0] = 0
for i in range(N-1):
t = min(K+1, N-i)
for j in range(1, t):
dp[i+j] = min(dp[i+j], dp[i]+abs(h[i+j]-h[i]))
print((dp[-1]))
main()
| def main():
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
# 初期化
# 初期条件
# ループ
# テーブルから解を得る
INF = float('inf')
dp = [INF] * N
dp[0] = 0
for i in range(N-1):
for j in range(1, min(K+1, N-i)):
dp[i+j] = min(dp[i+j], dp[i]+abs(h[i+j]-h[i]))
print((dp[-1]))
main()
| p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")] * n
dp[0] = 0
for i in range(n):
for j in range(0, min(i, k)+1):
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print((dp[-1]))
| n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
# n個の枠を作成
dp = [float("inf")] * n
# 初期値を0に
dp[0] = 0
#dp[i] =i番目まで来る最安の方法
for i in range(n):
for j in range(1, min(i, k)+1): # 上限が負にならないようにmin(i,k)で調整。+1でちゃんとrangeの癖を修正。
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print((dp[-1])) | p03161 |
import sys
# import pdb
input = sys.stdin.readline
N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
dp_list = [-1 for _ in range(N)]
dp_list[0] = 0
dp_list[1] = abs(hs[1] - hs[0])
import heapq
sys.setrecursionlimit(1000000)
def dp_memo(p):
if dp_list[p] != -1:
return dp_list[p]
costs = []
heapq.heapify(costs)
if K <= p:
for i in range(1,K+1):
heapq.heappush(costs, dp_memo(p-i) + abs(hs[p] - hs[p-i]))
# costs.append(dp_memo(p-i) + abs(hs[p] - hs[p-i]))
else:
for i in range(1,p+1):
heapq.heappush(costs, dp_memo(p-i) + abs(hs[p] - hs[p-i]))
# costs.append(dp_memo(p-i) + abs(hs[p] - hs[p-i]))
# result = min(costs)
result = heapq.heappop(costs)
dp_list[p] = result
return result
def dp_recur():
costs = []
costs[0] = 0
if N == 2:
print(cost2)
exit()
# pdb.set_trace()
for i in range(2, N):
cost3 = min(cost2 + abs(hs[i] - hs[i-1]), cost1 + abs(hs[i] - hs[i-2]))
cost1 = cost2
cost2 = cost3
return cost3
# print(dp_recur())
print((dp_memo(N-1)))
| import sys
# import pdb
input = sys.stdin.readline
N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
inf = 1e10
dp_list = [inf for _ in range(N)]
dp_list[0] = 0
# import heapq
sys.setrecursionlimit(1000000)
def dp_memo(p):
if dp_list[p] != -1:
return dp_list[p]
costs = []
# heapq.heapify(costs)
if K <= p:
for i in range(1,K+1):
# heapq.heappush(costs, dp_memo(p-i) + abs(hs[p] - hs[p-i]))
costs.append(dp_memo(p-i) + abs(hs[p] - hs[p-i]))
else:
for i in range(1,p+1):
# heapq.heappush(costs, dp_memo(p-i) + abs(hs[p] - hs[p-i]))
costs.append(dp_memo(p-i) + abs(hs[p] - hs[p-i]))
result = min(costs)
# result = heapq.heappop(costs)
dp_list[p] = result
return result
def dp_recur(N):
for i in range(1, N):
for j in range(1,K+1):
if i-j < 0:
break
dp_list[i] = min(dp_list[i], dp_list[i-j] + abs(hs[i] - hs[i-j]))
return dp_list[N-1]
print((dp_recur(N)))
# print(dp_memo(N-1))
| p03161 |
import sys
# import pdb
input = sys.stdin.readline
N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
inf = 1e10
dp_list = [inf for _ in range(N)]
dp_list[0] = 0
# import heapq
sys.setrecursionlimit(1000000)
def dp_memo(i):
if dp_list[i] != inf:
return dp_list[i]
result = dp_list[i]
for j in range(1, K+1):
if i-j < 0:
break
result = min(result, dp_memo(i-j) + abs(hs[i] - hs[i-j]))
dp_list[i] = result
return result
def dp_recur(N):
for i in range(1, N):
for j in range(1,K+1):
if i-j < 0:
break
dp_list[i] = min(dp_list[i], dp_list[i-j] + abs(hs[i] - hs[i-j]))
return dp_list[N-1]
# print(dp_recur(N))
print((dp_memo(N-1)))
| N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
total_cost = [-1 for i in range(N)]
total_cost[0] = 0
total_cost[1] = abs(hs[1] - hs[0])
for i in range(2, N):
for k in range(1, K+1):
if total_cost[i] == -1:
total_cost[i] = total_cost[i-k] + abs(hs[i] - hs[i-k])
else:
total_cost[i] = min(total_cost[i], total_cost[i-k] + abs(hs[i] - hs[i-k]))
if i == k:
break
print((total_cost[N-1]))
| p03161 |
N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
costs = [1e10 for _ in range(N)]
costs[0] = 0
for i in range(N):
for k in range(1, min(K+1, N-i)):
costs[i+k] = min(costs[i+k], costs[i] + abs(hs[i+k] - hs[i]))
print((costs[N-1]))
| N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
cost = [1e30 for _ in range(N)]
cost[0] = 0
for i in range(N):
for k in range(i+1, min(N, i+K+1)):
cost[k] = min(cost[k], cost[i] + abs(H[k] - H[i]))
print((cost[N-1]))
| p03161 |
N, K = list(map(int, input().split()))
H = [0] + list(map(int, input().split()))
dp = [10 ** 10] * (N+1)
dp[1] = 0
for i in range(1, N+1):
for j in range(1, K+1):
if i + j > N:
continue
dp[i+j] = min(dp[i+j], dp[i] + abs(H[i+j] - H[i]))
print((dp[N])) | N, K = list(map(int, input().split()))
H = [0] + list(map(int, input().split()))
dp = [10 ** 10] * (N+1)
dp[:2] = 0, 0
for i in range(1, N+1):
for j in range(1, K+1):
if i + j > N:
break
dp[i+j] = min(dp[i+j], dp[i] + abs(H[i+j] - H[i]))
print((dp[N])) | p03161 |
from sys import stdin,stdout
INT_MAX= 100000000
n,k=list(map(int,stdin.readline().split()))
dp = [INT_MAX]*(n)
h=[int(X) for X in stdin.readline().split()]
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
p=1
while(p<k+1 or i-p>=0):
dp[i]= min(dp[i-p+1]+abs(h[i-p+1]-h[i]),dp[i])
p+=1
stdout.write(str(dp[n-1])+"\n") | from sys import stdin,stdout
INT_MAX= 10**18
n,k=list(map(int,stdin.readline().split()))
dp = [INT_MAX]*(n)
h=[int(X) for X in stdin.readline().split()]
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
p=1
while(p<k+1 and (i-p)>=0):
dp[i]= min(dp[i-p]+abs(h[i-p]-h[i]),dp[i])
p+=1
stdout.write(str(dp[n-1])+"\n")
| p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf") for _ in range(n)]
dp[0] = 0
for i in range(n-1):
for j in range(1, min(k+1, n-i)):
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print((dp[n-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")]*n
dp[0] = 0
for i in range(1, n):
for j in range(1, k+1):
if i-j >= 0:
dp[i] = min(dp[i], dp[i-j] + abs(h[i]-h[i-j]))
print((dp[n-1])) | p03161 |
mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return list(map(int,sys.stdin.readline().split()))
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b=mi()
l=list(mi())
dp=[0]*a
dp[0]=0
for i in range(1,a):
dp[i]=min(abs(l[i]-l[i-j-1])+dp[i-j-1] for j in range(min(i,b)))
print((dp[-1])) | mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return list(map(int,sys.stdin.readline().split()))
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
def main():
a,b=mi()
l=list(mi())
dp=[0]*a
dp[0]=0
for i in range(1,a):
dp[i]=min(abs(l[i]-l[i-j-1])+dp[i-j-1] for j in range(min(i,b)))
print((dp[-1]))
main() | p03161 |
# @oj:atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-04-20 10:31
# @url:https://atcoder.jp/contests/dp/tasks/dp_b
import sys
def input():
return sys.stdin.readline().strip()
def main():
nk=list(map(int,input().split()))
h=list(map(int,input().split()))
n=nk[0]
k=nk[1]
dp=[10**9]*n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
for j in range(max(0,i-k),i):
dp[i]=min(dp[j]+abs(h[i]-h[j]),dp[i])
print((dp[-1]))
if __name__ == "__main__":
main() | import sys
def input():
return sys.stdin.readline().strip()
def main():
size, jumps = list(map(int, input().split()))
array = list(map(int, input().split()))
dp = [999999999] * size
dp[0]= 0
dp[1] = abs(array[0]- array[1])
for i in range(2,size):
dp[i] = min(abs(array[i] - array[j]) + dp[j] for j in range(max(0, i - jumps), i))
print((dp[size-1]))
if __name__ == "__main__":
main()
| p03161 |
# @oj:atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-04-20 10:31
# @url:https://atcoder.jp/contests/dp/tasks/dp_b
import sys
def input():
return sys.stdin.readline().strip()
def main():
nk=list(map(int,input().split()))
h=list(map(int,input().split()))
n=nk[0]
k=nk[1]
dp=[10**9]*n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for (i,x) in enumerate(dp[2:],2):
# dp[i]=min(dp[j]+abs(h[i]-h[j]) for j in range(max(0,i-k),i))
for j in range(max(0,i-k),i):
dp[i]=min(dp[j]+abs(h[i]-h[j]),dp[i])
print((dp[-1]))
if __name__ == "__main__":
main() | # @oj:atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-04-20 10:31
# @url:https://atcoder.jp/contests/dp/tasks/dp_b
import sys
def input():
return sys.stdin.readline().strip()
def main():
nk=list(map(int,input().split()))
h=list(map(int,input().split()))
n=nk[0]
k=nk[1]
dp=[10**9]*n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min(dp[j]+abs(h[i]-h[j]) for j in range(max(0,i-k),i))
# for j in range(max(0,i-k),i):
# dp[i]=min(dp[j]+abs(h[i]-h[j]),dp[i])
print((dp[-1]))
if __name__ == "__main__":
main() | p03161 |
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = dp[i-1] + abs(h[i] - h[i-1])
for j in range(2, K+1):
if i-j < 0:
break
else:
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
print((dp[-1]))
return
if __name__ == '__main__':
main()
| def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * n
for i in range(1, n):
j = max(0, i-k)
dp[i] = min(x + abs(h[i] - y) for x, y in zip(dp[j:i], h[j:i]))
print((dp[-1]))
return
if __name__ == '__main__':
main()
| p03161 |
n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
dp = [10**10]*n
dp[0] = 0
dp[1] = abs(l[0] - l[1])
for i in range(2,n):
for j in range(i-1,max(0,i-k)-1,-1):
tem = dp[j] + abs(l[i] - l[j])
if tem<dp[i]:
dp[i] = tem
print((dp[n-1]))
#print(dp)
| n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
dp = [10**9]*n
dp[0] = 0
dp[1] = abs(l[0] - l[1])
for i in range(2,n):
for j in range(i-1,max(0,i-k)-1,-1):
tem = dp[j] + abs(l[i] - l[j])
if tem<dp[i]:
dp[i] = tem
print((dp[n-1]))
| p03161 |
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
dp=[0]#足場iまでの最小コスト
for i in range(1,N):
l=max(0,i-K)
#m=min([d+abs(H[i]-h) for d,h in zip(dp[l:i],H[l:i])])
m=min(list(map(lambda d,h:d+abs(H[i]-h),dp[l:i],H[l:i])))
dp.append(m)
print((dp[-1])) | N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
dp=[0]#足場iまでの最小コスト
for i in range(1,N):
l=max(0,i-K)
m=min([d+abs(H[i]-h) for d,h in zip(dp[l:i],H[l:i])])
#m=min(map(lambda d,h:d+abs(H[i]-h),dp[l:i],H[l:i]))
dp.append(m)
print((dp[-1])) | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [10 ** 9] * n
dp[0] = 0
a = min(n, k)
for i in range(n):
for j in range(1, min(k + 1, n - i)):
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print((dp[-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [10 ** 9] * n
dp[0] = 0
for i in range(1, n):
j = max(0, i - k)
hi = h[i]
dp[i] = min(dpj + abs(hi - hj) for dpj, hj in zip(dp[j:i], h[j:i]))
print((dp[-1])) | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0]
for i in range(1, N):
min_v = 1050000000
for j in range(1, K+1):
if i - j >= 0:
min_v = min(min_v, dp[i - j] + abs(H[i] - H[i - j]))
dp.append(min_v)
print((dp[N-1])) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0 for _ in range(N)]
for i in range(1, N):
r = max(0, i - K)
dp[i] = min(d + abs(H[i] - h) for h, d in zip(H[r:i], dp[r:i]))
print((dp[N-1])) | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0 for _ in range(N)]
for i, hi in enumerate(H):
if i == 0:
continue
r = max(0, i - K)
dp[i] = min(d + abs(hi - h) for d, h in zip(dp[r:i], H[r:i]))
print((dp[N-1])) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0 for _ in range(N)]
for i in range(1, N):
min_v = 1050000000
for j in range(1, K+1):
if i - j >= 0:
min_v = min(min_v, dp[i - j] + abs(H[i] - H[i - j]))
dp[i] = min_v
print((dp[N-1])) | p03161 |
def main():
n,k = list(map(int,input().split()))
h = [int(i) for i in input().split()]
INF = float('inf')
dp = [INF for i in range(n)]
dp[0] = 0
for i in range(n):
for j in range(1,k+1):
if i+j<n:
dp[i+j] = min(dp[i]+abs(h[i]-h[i+j]),dp[i+j])
else:
break
print((dp[n-1]))
main() | def main():
n,k = list(map(int,input().split()))
h = [int(i) for i in input().split()]
INF = float('inf')
dp = [INF for i in range(n)]
dp[0] = 0
dp[1] = abs(h[0]-h[1])
for i in range(2,n):
dp[i] = min(dp[i-j]+abs(h[i-j]-h[i]) for j in range(1,min(i,k)+1))
print((dp[n-1]))
main()
| p03161 |
from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF(): return [float(x) for x in sys.stdin.readline().split()] # LIST FLOAT
def LS(): return sys.stdin.readline().split() # LIST STRING
def MI(): return map(int, sys.stdin.readline().split()) # MAP INT
def II(): return int(sys.stdin.readline()) # INPUT INT
def IS(): return input() # INPUT STRING
def P(x): return print(x)
def C(x): return Counter(x)
def GCD_LIST(numbers): # greatest common divisor
return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): # least common multiple
return reduce(LCM, numbers)
def LCM(m, n):
return (m * n // fractions.gcd(m, n))
n, k = MI()
dp = [INF] * n
h = LI()
dp[0] = 0
for i in range(0, n-1):
for j in range(1, k+1):
if n <= i+j:
continue
dp[i+j] = min(dp[i] + abs(h[i]-h[i+j]), dp[i+j])
P(dp[n-1])
| from collections import Counter
from functools import reduce
import fractions
import math
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF(): return [float(x) for x in sys.stdin.readline().split()] # LIST FLOAT
def LS(): return sys.stdin.readline().split() # LIST STRING
def MI(): return map(int, sys.stdin.readline().split()) # MAP INT
def II(): return int(sys.stdin.readline()) # INPUT INT
def IS(): return input() # INPUT STRING
def P(x): return print(x)
def C(x): return Counter(x)
def GCD_LIST(numbers): # greatest common divisor
return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): # least common multiple
return reduce(LCM, numbers)
def LCM(m, n):
return (m * n // fractions.gcd(m, n))
n, k = MI()
dp = [INF] * n
h = LI()
dp[0] = 0
for i in range(0, n-1):
for j in range(1, k+1):
if n <= i+j:
continue
dp[i+j] = min(dp[i] + abs(h[i]-h[i+j]), dp[i+j])
P(dp[n-1])
| p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 10 ** 12
dp = [INF] * 100010
dp[0] = 0
for i in range(1, N):
for j in range(1, K+1):
if i - j >= 0:
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
print((dp[N-1]))
| N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 10 ** 10
dp = [INF] * 100010
dp[0] = 0
for i in range(N):
for j in range(1, K+1):
if i >= j:
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
print((dp[N-1])) | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 1001001001
dp = [inf] * (n+1)
dp[0] = 0
dp[1] = abs(h[0]-h[1])
for i in range(n):
for j in range(i + k):
if i + j >= n:
break
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]))
print((dp[n-1]))
| n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 1001001001
dp = [inf] * (n+1)
dp[0] = 0
dp[1] = abs(h[0]-h[1])
for i in range(n):
for j in range(k):
if i + j >= n:
break
dp[i + j] = min(dp[i + j], dp[i-1] + abs(h[i+j] - h[i-1]))
print((dp[n-1]))
| p03161 |
if __name__ == '__main__':
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
hs = list(map(int, input().split()))
if n <= k+1:
print((abs(hs[0]-hs[-1])))
exit()
ans_list = [0]*n
last_hs = hs[-1]
for i in range(1,k+1):
ans_list[-i] = abs(last_hs - hs[-i])
for i in range(k+1,n+1):
hs_i = hs[-i]
ans_list[-i] = min([abs(hs_i-hs[x])+ans_list[x] for x in range(1-i,k+1-i)])
print((ans_list[0]))
| if __name__ == '__main__':
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
hs = list(map(int, input().split()))
if n <= k+1:
print((abs(hs[0]-hs[-1])))
exit()
ans_list = [0]*n
last_hs = hs[-1]
for i in range(1,k+2):
ans_list[-i] = abs(last_hs - hs[-i])
for i in range(k+2,n+1):
hs_i = hs[-i]
ans_list[-i] = min([abs(hs_i-x)+y for x,y in zip(hs[1-i:k+1-i],ans_list[1-i:k+1-i])])
print((ans_list[0]))
| p03161 |
if __name__ == '__main__':
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
INF = 10**9
dp = [INF] * (n+1)
dp[0] = 0
k = min(k,n)
for i in range(1,n):
for j in range(1,k+1):
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1]))
| if __name__ == '__main__':
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
#TLE pypy
INF = 10**9
dp = [INF] * (n+1)
dp[0] = 0
k = min(k,n)
for i in range(1,n):
for j in range(1,k+1):
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1]))
| p03161 |
n, k = list(map(int, input().split()))
# 2237
H = list(map(int, input().split()))
dp = [float("inf")]*(n+2)
dp[0] = 0
for i in range(n):
for j in range(1, k+1):
if i+j >= n:
break
dp[i+j] = min(dp[i+j], dp[i]+abs(H[i]-H[i+j]))
print((dp[n-1]))
| n, k = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [float("inf")]*(n+2)
dp[0] = 0
for i in range(n):
for j in range(1, k+1):
if i+j >= n:
break
dp[i+j] = min(dp[i+j], dp[i]+abs(H[i]-H[i+j]))
print((dp[n-1]))
| p03161 |
# Educational DP Contest B-Frog 2
def frog(N, K, h):
# initialize
inf = float('inf')
dp = [inf] * N
minKN = min(K, N)
for i in range(minKN):
if i == 0:
dp[i] = 0
else:
dp[i] = abs(h[0] - h[i])
for j in range(minKN):
if j == i:
continue
elif j < i:
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]))
# DP
for i in range(N):
if i == 0:
continue
elif i < K:
continue
else:
dp[i] = min([abs(h[k] - h[i]) + dp[k] for k in range(i-K, i)])
return dp[N-1]
if __name__ == "__main__":
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
print((frog(N, K, h))) | # ducational DP Contest B-Frog 2
N, K = list(map(int, input().split()))
h = list(map(int, input().split())) + [0]*K
dp = [float('inf') for _ in range(N+K)]
dp[0] = 0
for i in range(N):
for j in range(1, K+1):
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print((dp[N-1])) | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
# DP
inf = float("inf")
dp = [inf for _ in range(N)]
dp[0] = 0
for i in range(1, N):
for k in range(1, K+1):
if i - k < 0:
break
dp[i] = min(dp[i], dp[i-k] + abs(h[i] - h[i-k]))
print((dp[-1])) | # Frog2
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = float("inf")
dp = [inf for _ in range(N)]
dp[0] = 0
for i in range(N):
for j in range(1, K+1):
if i + j >= N:
break
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i+j]))
print((dp[-1])) | p03161 |
import heapq
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
dp[1] = dp[0] + abs(h[1]-h[0])
for i in range(2, N):
compare = []
heapq.heapify(compare)
cnt = min(K, i)
for j in range(cnt):
heapq.heappush(compare, dp[i-j-1] + abs(h[i]-h[i-j-1]))
dp[i] = heapq.heappop(compare)
print((dp[-1]))
| N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
dp[1] = dp[0] + abs(h[1]-h[0])
for i in range(2, N):
compare = []
cnt = min(K, i)
for j in range(cnt):
compare.append(dp[i-j-1] + abs(h[i]-h[i-j-1]))
dp[i] = min(compare)
print((dp[-1]))
| p03161 |
n,k = list(map(int,input().split(' ')))
h = list(map(int, input().split(' ')))
dp = [0]*n
for i in range(1,n):
temp = dp[i-1]+abs(h[i]-h[i-1])
for j in range(2,k+1):
if i-j>=0:
temp = min(dp[i-j]+abs(h[i]-h[i-j]), temp)
dp[i] = temp
print((dp[-1])) | n,k = list(map(int,input().split(' ')))
h = list(map(int, input().split(' ')))
dp = [0]*n
for i in range(1,n):
dp[i] = dp[i-1]+abs(h[i]-h[i-1])
for j in range(2,k+1):
if i-j>=0:
dp[i] = min(dp[i-j]+abs(h[i]-h[i-j]), dp[i])
print((dp[-1])) | p03161 |
#!/usr/bin/env python3
import sys
def solve(N: int, K: int, h: "List[int]"):
cumsums = [float("inf")]*N
cumsums[0]=0
cumsums[1]=abs(h[1]-h[0])
for i in range(1, N):
for j in range(1, K+1):
if i >= j:
cumsums[i] = min(cumsums[i], cumsums[i-j]+abs(h[i]-h[i-j]))
#print(cumsums)
return cumsums[-1]
# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
h = [ int(next(tokens)) for _ in range(N) ] # type: "List[int]"
print((solve(N, K, h)))
if __name__ == '__main__':
main()
| import sys
def solve(N: int, K: int, h: "List[int]"):
cumsums = [float("inf")]*N
cumsums[0]=0
cumsums[1]=abs(h[1]-h[0])
for i in range(1, N):
for j in range(1, K+1):
if i >= j:
cumsums[i] = min(cumsums[i], cumsums[i-j]+abs(h[i]-h[i-j]))
#print(cumsums)
return cumsums[-1]
N, K = list(map(int, sys.stdin.readline().rstrip().split()))
h = list(map(int, sys.stdin.readline().rstrip().split()))
print((solve(N, K, h))) | p03161 |
n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
INF = 10**10
dp = [INF] * n
dp[0] = 0
# dp[i] = (足場iにたどり着いた時点でのコストの最小値)
for i in range(n):
for j in range(i + 1, min(i + k + 1, n)):
if dp[j] > dp[i] + abs(h[j] - h[i]):
dp[j] = dp[i] + abs(h[j] - h[i])
print((dp[n - 1]))
| n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
INF = 10**10
dp = [INF] * n
dp[0] = 0
# dp[i] = (足場iにたどり着いた時点でのコストの最小値)
for i in range(1, n):
dp[i] = min(dp[j] + abs(h[j] - h[i]) for j in range(max(0, i - k), i))
print((dp[n - 1]))
| p03161 |
import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
h = tuple(map(int,input().split()))
dp = [0] + [float("inf")]*(n-1)
for i in range(1,n):
for j in range(max(0,i-k),i):
dp[i] = min(dp[i],dp[j]+abs(h[i]-h[j]))
print((dp[-1])) | n, k = list(map(int,input().split()))
h = list(map(int, input().split()))
dp = [0] + [float("inf")]*(n-1)
for i in range(1, n):
for j in range(max(0, i-k), i):
dp[i] = min(dp[i], dp[j]+abs(h[i]-h[j]))
print((dp[-1])) | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float('Inf')] * n
dp[0] = 0
for i in range(n):
for j in range(i+1, i+k+1):
if j < n:
dp[j] = min(dp[j], dp[i]+abs(h[i]-h[j]))
print((dp[-1])) | import sys
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [sys.maxsize] * n
dp[0] = 0
for i in range(n):
for j in range(i+1, i+k+1):
if j < n:
dp[j] = min(dp[j], dp[i]+abs(h[i]-h[j]))
print((dp[-1])) | p03161 |
def main():
N, K = list(map(int,input().split()))
h = [int(v) for v in input().split()]
dp = [0 for _ in range(N)]
dp[1] = abs(h[0] - h[1])
for i in range(2, N):
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(i - K, i) if j >= 0])
print((dp[-1]))
if __name__ == '__main__':
main() | def main():
N, K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0] * N
dp[1] = abs(h[0] - h[1])
for i in range(2, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[-1]))
if __name__ == '__main__':
main() | p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0]*N
for i in range(1,N):
dp[i]= min(abs(h[i]-h[j])+dp[j] for j in range(max(0,i-K),i))
print((dp[-1])) | def main():
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0]*N
for i in range(1,N):
dp[i]= min(abs(h[i]-h[j])+dp[j] for j in range(max(0,i-K),i))
print((dp[-1]))
main() | p03161 |
N,K = list(map(int, input().split()))
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
mn = 999999999999999999
for j in range(1,K+1):
if i-j >= 0:
mn = min(mn,dp[i - j] + abs(lst[i] - lst[i - j]))
else:
break
dp[i] = mn
print((dp[-1])) | N,K = list(map(int, input().split()))
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
mn = 999999999999999999
for j in range(max(i-K,0), i):
mn = min(mn,dp[j] + abs(lst[i] - lst[j]))
dp[i] = mn
print((dp[-1])) | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
# 最小なものにコストを書き換えたいので初期値は大きく取る
dp = [float('inf')] * N
# 最初はコスト０
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[j] + abs(H[i] - H[j]) for j in range(max(i - K, 0), i))
print((int(dp[i])))
| def test():
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [float('inf')]*N
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[j] + abs(H[i] - H[j]) for j in range(max(i-K, 0), i))
print((dp[-1]))
if __name__ == '__main__':
test() | p03161 |
import math
import bisect
import heapq
from collections import deque
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
d = [float('inf')] * n
d[0] = 0
for j in range(1, n):
p = [d[i] + abs(h[j] - h[i]) for i in range(max(0, j - k), j)]
d[j] = min(p)
print((d[n - 1]))
| import math
import bisect
import heapq
from collections import deque
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
d = [float('inf')] * n
d[0] = 0
for j in range(1, n):
p = [d[i] + abs(h[j] - h[i]) for i in range(max(0, j - k), j)]
d[j] = min(p)
print((d[-1]))
if __name__ == "__main__":
main() | p03161 |
import math
import bisect
import heapq
from collections import deque
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10**7
d = [inf] * n
d[0] = 0
for j in range(1, n):
p = [d[i] + abs(h[j] - h[i]) for i in range(max(0, j - k), j)]
d[j] = min(p)
print((d[-1]))
if __name__ == "__main__":
main() | # import math
# import bisect
# import heapq
# from collections import deque
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10**7
d = [inf] * n
d[0] = 0
for j in range(1, n):
p = [d[i] + abs(h[j] - h[i]) for i in range(max(0, j - k), j)]
d[j] = min(p)
print((d[-1]))
if __name__ == "__main__":
main() | p03161 |
from sys import stdin
N,K=list(map(int,stdin.readline().split()))
h=[int(i) for i in stdin.readline().split()][:N]
dp=[float('inf')]*N
dp[0]=0
for i in range(N):
for j in range(i+1,i+K+1):
if j<N:
dp[j]=min(dp[j],dp[i]+abs(h[j]-h[i]))
#print(dp)
print((dp[-1])) | from sys import stdin
N,K=list(map(int,stdin.readline().split()))
h=[int(i) for i in stdin.readline().split()][:N]
dp=[float('inf') for i in range(N)]
dp[0]=0
for i in range(N):
for j in range(i+1,i+K+1):
if j<N:
dp[j]=min(dp[j],dp[i]+abs(h[j]-h[i]))
#print(dp)
print((dp[-1])) | p03161 |
from collections import deque
def solve(n,k,arr):
q,cost_=deque([ (0,0) ]),float('inf') # (idx,cost)
last_level=0
while q:
for _ in range(len(q)):
idx,cost=q.popleft()
if idx==n-1:
cost_=min(cost_,cost)
last_level=1
else:
if not last_level:
# choose next 3 elem as the exploring options
options = [j for j in range(idx + 1, idx + 1 + k) if j < n]
for index in options:
q.append((index, cost+abs(arr[index] - arr[idx])))
print(cost_)
n,k=list(map(int,input().split()))
arr=list(map(int,input().split()))
solve(n,k,arr) | def solve(n,k,arr):
if n==1:
return 0
else:
dp=[float('inf') for _ in range(n)]
dp[0]=0
for i in range(n):
for j in range(i+1,i+k+1):
if j<n:
dp[j]=min(
dp[j], dp[i]+abs(arr[i]-arr[j])
)
return dp[-1]
n,k=list(map(int,input().split()))
arr=list(map(int,input().split()))
print((solve(n,k,arr))) | p03161 |
inf = float('inf')
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [inf] * n
dp[0] = 0
for i in range(1, n):
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]) for j in range(1, k + 1) if i - j >= 0)
print((dp[n - 1]))
| inf = float('inf')
n, k = list(map(int, input().split()))
h = list(map(int, input().split())) + [inf] * k
dp = [inf] * (n + k)
dp[0] = 0
# 配る
for i in range(n - 1):
for j in range(1, k + 1):
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]))
print((dp[n - 1]))
| p03161 |
def solve(n,k,ar):
dp = [int(1e9)]*n
dp[0] = 0
for i in range(n):
for j in range(i+1,i+k+1):
if j < n:
dp[j] = min(dp[j], dp[i] + abs(ar[i]-ar[j]))
print((dp[n-1]))
def solve1(n,k,ar):
dp = [int(1e9)] * (n)
dp[0] = 0
for i in range(1,n):
for k in range(1,k+1):
if i-k >= 0:
dp[i] = min(dp[i], dp[i-k] + abs(ar[i]-ar[i-k]))
print((dp[n-1]))
if __name__ == '__main__':
n,k = list(map(int,input().split()))
ar = list(map(int,input().split()))
solve(n,k,ar) | import sys
def solve(n,k,ar):
dp = [sys.maxsize]*n
dp[0] = 0
for i in range(n):
for k in range(1,k+1):
if i+k <= n-1:
dp[i+k] = min(dp[i+k], dp[i] + abs(ar[i]-ar[i+k]))
print((dp[n-1]))
if __name__ == '__main__':
n,k = list(map(int,input().split()))
ar = list(map(int,input().split()))
solve(n,k,ar) | p03161 |
def solve():
N, K = list(map(int, input().split(" ")))
h = input().split(" ")
h = [int(number) for number in h]
minimumCostToReach = [0 for i in range(N)]
minimumCostToReach[0] = 0
for currentIndex in range(1, N):
minimumCostToReach[currentIndex] = 1000000000
for previousIndex in range(max(currentIndex - K, 0), currentIndex):
cost = minimumCostToReach[previousIndex] + abs(h[currentIndex] - h[previousIndex])
minimumCostToReach[currentIndex] = min(minimumCostToReach[currentIndex], cost)
print((minimumCostToReach[N - 1]))
solve() | def solve():
N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
minimumCost = [0] * N
for currentIndex in range(1, N):
minimumCost[currentIndex] = min(minimumCost[previousIndex] + abs(h[currentIndex] - h[previousIndex]) for previousIndex in range(max(currentIndex - K, 0), currentIndex))
print((minimumCost[N - 1]))
solve()
| p03161 |
## necessary imports
import sys
input = sys.stdin.readline
from math import log2, log, ceil
# swap_array function
def swaparr(arr, a,b):
temp = arr[a];
arr[a] = arr[b];
arr[b] = temp
## gcd function
def gcd(a,b):
if a == 0:
return b
return gcd(b%a, a)
## nCr function efficient using Binomial Cofficient
def nCr(n, k):
if(k > n - k):
k = n - k
res = 1
for i in range(k):
res = res * (n - i)
res = res / (i + 1)
return res
## upper bound function code -- such that e in a[:i] e < x;
def upper_bound(a, x, lo=0):
hi = len(a)
while lo < hi:
mid = (lo+hi)//2
if a[mid] < x:
lo = mid+1
else:
hi = mid
return lo
## prime factorization
def primefs(n):
## if n == 1 ## calculating primes
primes = {}
while(n%2 == 0):
primes[2] = primes.get(2, 0) + 1
n = n//2
for i in range(3, int(n**0.5)+2, 2):
while(n%i == 0):
primes[i] = primes.get(i, 0) + 1
n = n//i
if n > 2:
primes[n] = primes.get(n, 0) + 1
## prime factoriazation of n is stored in dictionary
## primes and can be accesed. O(sqrt n)
return primes
## MODULAR EXPONENTIATION FUNCTION
def power(x, y, p):
res = 1
x = x % p
if (x == 0) :
return 0
while (y > 0) :
if ((y & 1) == 1) :
res = (res * x) % p
y = y >> 1
x = (x * x) % p
return res
## DISJOINT SET UNINON FUNCTIONS
def swap(a,b):
temp = a
a = b
b = temp
return a,b
# find function with path compression included (recursive)
# def find(x, link):
# if link[x] == x:
# return x
# link[x] = find(link[x], link);
# return link[x];
# find function with path compression (ITERATIVE)
def find(x, link):
p = x;
while( p != link[p]):
p = link[p];
while( x != p):
nex = link[x];
link[x] = p;
x = nex;
return p;
# the union function which makes union(x,y)
# of two nodes x and y
def union(x, y, link, size):
x = find(x, link)
y = find(y, link)
if size[x] < size[y]:
x,y = swap(x,y)
if x != y:
size[x] += size[y]
link[y] = x
## returns an array of boolean if primes or not USING SIEVE OF ERATOSTHANES
def sieve(n):
prime = [True for i in range(n+1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * p, n+1, p):
prime[i] = False
p += 1
return prime
#### PRIME FACTORIZATION IN O(log n) using Sieve ####
MAXN = int(1e6 + 5)
def spf_sieve():
spf[1] = 1;
for i in range(2, MAXN):
spf[i] = i;
for i in range(4, MAXN, 2):
spf[i] = 2;
for i in range(3, ceil(MAXN ** 0.5), 2):
if spf[i] == i:
for j in range(i*i, MAXN, i):
if spf[j] == j:
spf[j] = i;
## function for storing smallest prime factors (spf) in the array
################## un-comment below 2 lines when using factorization #################
# spf = [0 for i in range(MAXN)]
# spf_sieve()
def factoriazation(x):
ret = {};
while x != 1:
ret[spf[x]] = ret.get(spf[x], 0) + 1;
x = x//spf[x]
return ret
## this function is useful for multiple queries only, o/w use
## primefs function above. complexity O(log n)
## taking integer array input
def int_array():
return list(map(int, input().strip().split()))
## taking string array input
def str_array():
return input().strip().split();
#defining a couple constants
MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');
################### ---------------- TEMPLATE ENDS HERE ---------------- ###################
n, k = int_array(); a = int_array();
dp = [INF]*n; dp[0] = 0;
for i in range(n):
for j in range(i+1, min(n, i+k+1)):
x = dp[i] + abs(a[j]- a[i]);
dp[j] = min(dp[j], x);
print((dp[-1])); | ## necessary imports
#import sys
#input = sys.stdin.readline
#from math import log2, log, ceil
# swap_array function
def swaparr(arr, a,b):
temp = arr[a];
arr[a] = arr[b];
arr[b] = temp
## gcd function
def gcd(a,b):
if a == 0:
return b
return gcd(b%a, a)
## nCr function efficient using Binomial Cofficient
def nCr(n, k):
if(k > n - k):
k = n - k
res = 1
for i in range(k):
res = res * (n - i)
res = res / (i + 1)
return res
## upper bound function code -- such that e in a[:i] e < x;
def upper_bound(a, x, lo=0):
hi = len(a)
while lo < hi:
mid = (lo+hi)//2
if a[mid] < x:
lo = mid+1
else:
hi = mid
return lo
## prime factorization
def primefs(n):
## if n == 1 ## calculating primes
primes = {}
while(n%2 == 0):
primes[2] = primes.get(2, 0) + 1
n = n//2
for i in range(3, int(n**0.5)+2, 2):
while(n%i == 0):
primes[i] = primes.get(i, 0) + 1
n = n//i
if n > 2:
primes[n] = primes.get(n, 0) + 1
## prime factoriazation of n is stored in dictionary
## primes and can be accesed. O(sqrt n)
return primes
## MODULAR EXPONENTIATION FUNCTION
def power(x, y, p):
res = 1
x = x % p
if (x == 0) :
return 0
while (y > 0) :
if ((y & 1) == 1) :
res = (res * x) % p
y = y >> 1
x = (x * x) % p
return res
## DISJOINT SET UNINON FUNCTIONS
def swap(a,b):
temp = a
a = b
b = temp
return a,b
# find function with path compression included (recursive)
# def find(x, link):
# if link[x] == x:
# return x
# link[x] = find(link[x], link);
# return link[x];
# find function with path compression (ITERATIVE)
def find(x, link):
p = x;
while( p != link[p]):
p = link[p];
while( x != p):
nex = link[x];
link[x] = p;
x = nex;
return p;
# the union function which makes union(x,y)
# of two nodes x and y
def union(x, y, link, size):
x = find(x, link)
y = find(y, link)
if size[x] < size[y]:
x,y = swap(x,y)
if x != y:
size[x] += size[y]
link[y] = x
## returns an array of boolean if primes or not USING SIEVE OF ERATOSTHANES
def sieve(n):
prime = [True for i in range(n+1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * p, n+1, p):
prime[i] = False
p += 1
return prime
#### PRIME FACTORIZATION IN O(log n) using Sieve ####
MAXN = int(1e6 + 5)
def spf_sieve():
spf[1] = 1;
for i in range(2, MAXN):
spf[i] = i;
for i in range(4, MAXN, 2):
spf[i] = 2;
for i in range(3, ceil(MAXN ** 0.5), 2):
if spf[i] == i:
for j in range(i*i, MAXN, i):
if spf[j] == j:
spf[j] = i;
## function for storing smallest prime factors (spf) in the array
################## un-comment below 2 lines when using factorization #################
# spf = [0 for i in range(MAXN)]
# spf_sieve()
def factoriazation(x):
ret = {};
while x != 1:
ret[spf[x]] = ret.get(spf[x], 0) + 1;
x = x//spf[x]
return ret
## this function is useful for multiple queries only, o/w use
## primefs function above. complexity O(log n)
## taking integer array input
def int_array():
return list(map(int, input().strip().split()))
## taking string array input
def str_array():
return input().strip().split();
#defining a couple constants
MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');
################### ---------------- TEMPLATE ENDS HERE ---------------- ###################
n, k = int_array(); a = int_array();
dp = [INF]*n; dp[0] = 0;
for i in range(n):
for j in range(i+1, min(n, i+k+1)):
x = dp[i] + abs(a[j]- a[i]);
dp[j] = min(dp[j], x);
print((dp[-1])); | p03161 |
#!/mnt/c/Users/moiki/bash/env/bin/python
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
suml = [1e9 for i in range(N)]
suml[0] = 0
for e in range(1,N):
# for k in range(1, min([e, K])+1):
# suml[e] = min(suml[e],
# abs(h[e]-h[e-k]) + suml[e-k]
# )
start = max(0, e-K)
cost = min(cst + abs( h[e] - hgh ) for cst, hgh in zip(suml[start:e],
h[start:e]))
suml[e] = cost
print((suml[N-1]))
| #!/mnt/c/Users/moiki/bash/env/bin/python
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
# suml = [1e9 for i in range(N)]
# suml[0] = 0
suml = [0]*N
for e in range(1,N):
# for k in range(1, min([e, K])+1):
# suml[e] = min(suml[e],
# abs(h[e]-h[e-k]) + suml[e-k]
# )
start = max(0, e-K)
cost = min(cst + abs( h[e] - hgh ) for cst, hgh in zip(suml[start:e],
h[start:e]))
suml[e] = cost
print((suml[N-1]))
| p03161 |
n, k = tuple(map(int, input().split()))
hs = list(map(int, input().split()))
cs = [0 for _ in range(k)]
k_i = 0
for i in range(1, n):
if i < k:
cs[i] = min([cs[j] + abs(hs[j] - hs[i]) for j in range(i)])
else:
k_i = i % k
cs[k_i] = min([
cs[(k_i - j - 1) % k] + abs(hs[i - j - 1] - hs[i])
for j in range(k)
])
print((cs[i % k]))
| n, k = list(map(int, input().split()))
hs = list(map(int, input().split()))
dp = [0] + [float("inf") for _ in range(n - 1)]
for i in range(1, n):
for j in range(1, min(i, k) + 1):
dp[i] = min(dp[i], dp[i - j] + abs(hs[i - j] - hs[i]))
print((dp[i])) | p03161 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[float('inf')]*n
dp[0]=0
for i in range(0,n):
for j in range(1,k+1):
if i+j>n-1:
continue
dp[i+j]=min(dp[i+j],dp[i]+abs(a[i]-a[i+j]))
print((dp[-1])) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[10**9]*(n)
dp[0]=0
for i in range(1,n):
for j in range(1,k+1):
if i-j<0:
continue
dp[i]=min(dp[i],dp[i-j]+abs(a[i]-a[i-j]))
print((dp[n-1])) | p03161 |
# import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(eval(input()))
def main():
N, K = geta(int)
h = geta(int)
INF = 1 << 60
dp = [INF for _ in range(N)]
dp[0], dp[1] = 0, abs(h[0] - h[1])
for i in range(2, N):
lb = i - K if i > K else 0
for j in range(lb, i):
tmp = dp[j] + abs(h[j] - h[i])
if tmp < dp[i]:
dp[i] = tmp
print((dp[N - 1]))
if __name__ == "__main__":
main() | # import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(eval(input()))
def main():
N, K = geta(int)
h = geta(int)
INF = 1 << 60
dp = [INF]*N
dp[0], dp[1] = 0, abs(h[0] - h[1])
for i in range(2, N):
lb = i - K if i > K else 0
for j in range(lb, i):
tmp = dp[j] + abs(h[j] - h[i])
if tmp < dp[i]:
dp[i] = tmp
print((dp[N - 1]))
if __name__ == "__main__":
main() | p03161 |
# import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(eval(input()))
def main():
N, K = geta(int)
h = geta(int)
INF = 1 << 60
dp = [INF]*N
dp[0], dp[1] = 0, abs(h[0] - h[1])
for i in range(2, N):
lb = i - K if i > K else 0
for j in range(lb, i):
tmp = dp[j] + abs(h[j] - h[i])
if tmp < dp[i]:
dp[i] = tmp
print((dp[-1]))
if __name__ == "__main__":
main() | # import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(eval(input()))
def main():
N, K = geta(int)
h = geta(int)
INF = 1 << 60
dp = [INF]*N
dp[0], dp[1] = 0, abs(h[0] - h[1])
for i in range(2, N):
lb = i - K if i > K else 0
for j in range(lb, i):
tmp = dp[j] + abs(h[j] - h[i])
if tmp < dp[i]:
dp[i] = tmp
print((dp[N - 1]))
if __name__ == "__main__":
main()
| p03161 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.