input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from math import inf
n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
dp = [inf for _ in range(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], abs(a[i] - a[i - j]) + dp[i - j])
print((dp[-1]))
| from math import inf
n, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
dp = [inf for _ in range(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], abs(a[i] - a[i - j]) + dp[i - j])
else:
break
print((dp[-1]))
| p03161 |
def number():
return int(eval(input()))
def space():
return list(map(int, input().split()))
N, K = space()
H = space()
inf = 10**4+1
dp = [0] * N
dp[0] = 0
for i in range(1, N):
v = []
for j in range(max(0, i - K), i):
v.append(dp[j] + abs(H[j] - H[i]))
# dp[i] = min(dp[i], dp[j] + abs(H[j] - H[i]))
dp[i] = min(v)
print((dp[-1]))
| def number():
return int(eval(input()))
def space():
return list(map(int, input().split()))
N, K = space()
H = space()
dp = [0] * N
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[-1]))
| p03161 |
n, k = list(map(int, input().split()))
h_l = list(map(int, input().split()))
dp = [0] * n
for i in range(n-1):
dp[i+1] = min(dp[i+1-j]+abs(h_l[i+1]-h_l[i+1-j]) for j in range(1, min(i+1,k)+1))
print((dp[-1])) | n, k = list(map(int, input().split()))
h_l = list(map(int, input().split()))
dp = [float('inf')] * n
dp[0] = 0
for i in range(1, n):
from_jump = max(0,i-k)
dp[i] = min(dp[j]+abs(h_l[i]-h_l[j]) for j in range(from_jump,i))
print((dp[n-1])) | p03161 |
from collections import Counter
from collections import deque
import math
import bisect
import sys
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,input().split()))
n,k=mp()
h=lmp()
h.insert(0,0)
dp=[float("inf")]*(n+1)
dp[1]=0
for i in range(1,n+1):
for j in range(1,k+1):
if i+j<=n:
dp[i+j]=min(dp[i+j],abs(h[i+j]-h[i])+dp[i])
print((dp[n]))
| n,k = list(map(int,input().split()))
height = list(map(int,input().split()))
cost_list = []
for m in range(1,n+1):
if m <= k:
cost_list.append(abs(height[m-1]-height[0]))
else:
Min = cost_list[-1] + abs(height[m-2]-height[m-1])
if k > 1:
for x in range(2,k+1):
money2 = cost_list[-x] + abs(height[m-x-1]-height[m-1])
if money2 < Min:
Min = money2
cost_list.append(Min)
print((cost_list[-1])) | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
h.insert(0, float("inf"))
dp = [float("inf")] * (N + 1)
dp[1] = 0
for i in range(2, N + 1):
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]))
print((dp[N])) | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
h.insert(0, float("inf"))
dp = [float("inf")] * (N + 1)
dp[1] = 0
for i in range(2, N + 1):
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
print((dp[N])) | p03161 |
import sys
input = sys.stdin.readline
N,K = list(map(int,input().split()))
h = [0] + list(map(int,input().split()))
dp = [None for _ in range(N+1)]
dp[1] = 0
for i in range(2,N+1):
scope = min(i-1,K)
jump = [dp[i-x] + abs(h[i]-h[i-x]) for x in range(1,scope+1)]
dp[i] = min(jump)
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):
scope = min(i-1,K)
jump = [dp[i-j]+abs(h[i]-h[i-j]) for j in range(1,scope+1)]
dp[i] = min(jump)
print((dp[N])) | p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
INF = 10**4+1
dp = [INF]*n
dp[0]=0
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])) | n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
INF = 10**4+1
dp = [INF]*n
dp[0]=0
for i in range(1,n):
hi=h[i]
dp[i] = min([dp[j] + abs(h[j]-hi) for j in range(max(0, i-k),i)])
print((dp[n-1])) | p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
INF = 10**4+1
dp = [INF]*n
dp[0]=0
for i in range(1,n):
hi=h[i]
dp[i] = min([dp[j] + abs(h[j]-hi) for j in range(max(0, i-k),i)])
print((dp[n-1])) | n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
INF = 10**4+1
dp = [INF]*n
dp[0]=0
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 |
# coding:utf-8
N, K = list(map(int, input().split()))
H = [int(hi) for hi in input().split()]
dp = [0]*N
for i in range(1, K+1):
if i > N-1:
break
dp[i] = abs(H[0]-H[i])
for i in range(K+1, N):
dp[i] = min([dp[i-j]+abs(H[i-j]-H[i]) for j in range(1, K+1)])
print((dp[N-1])) | # coding:utf-8
N, K = list(map(int, input().split()))
H = [int(hi) for hi in input().split()]
dp = [0]*(N+1)
for i in range(1, K+1):
if i <= N-1:
dp[i] = abs(H[0]-H[i])
for i in range(K+1, N):
dp[i] = min([dpk + abs(hk - H[i]) for dpk, hk in zip(dp[i-K:i], H[i-K:i])])
print((dp[N-1])) | p03161 |
import sys
import heapq
input = sys.stdin.readline
max_cost = 10**9
n, k = list(map(int, input().split()))
hs = list(map(int, input().split()))
min_cost = [float('inf')] * n
graph = [[(j, abs(hs[i] - hs[j])) for j in range(i+1, i+k+1) if j < n] for i in range(n)]
def dijkstra(source, target):
hq = [(0, source)]
while hq:
cost, vertex = heapq.heappop(hq)
min_cost[vertex] = cost
if vertex == target:
return min_cost[vertex]
for adjacency_vertex, adjacency_cost in graph[vertex]:
heapq.heappush(hq, (cost + adjacency_cost, adjacency_vertex))
print((dijkstra(0, n-1)))
| n, k = list(map(int, input().split()))
hs = list(map(int, input().split()))
min_cost = [float('inf')] * n
min_cost[0] = 0
for i in range(1, n):
min_cost[i] = min([min_cost[i-j] + abs(hs[i] - hs[i-j]) for j in range(1, k+1) if i-j >= 0])
print((min_cost[n-1]))
| p03161 |
def small(a, b):
if a > b:
return b
else:
return a
def main():
n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
INF = 10 ** 9
dp = [INF] * n
dp[0] = 0
for i in range(n):
for j in range(1, k + 1):
i_j = i + j
if i_j < n:
dp[i_j] = small(dp[i_j], dp[i] + abs(h[i] - h[i_j]))
print((dp[-1]))
if __name__ == "__main__":
main() | def main():
n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
INF = 10 ** 9
dp = [INF] * n
dp[0] = 0
for i in range(n):
for j in range(1, k + 1):
i_j = i + j
if i_j < n:
x = dp[i] + abs(h[i] - h[i_j])
if dp[i_j] > x:
dp[i_j] = x
print((dp[-1]))
if __name__ == "__main__":
main() | p03161 |
def main():
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
dp = [10 ** 9] * n
dp[0] = 0
for i in tuple(range(n)):
for j in tuple(range(1, k + 1)):
i_j = i + j
if i_j < n:
x = dp[i] + abs(h[i] - h[i_j])
if dp[i_j] > x:
dp[i_j] = x
print((dp[-1]))
if __name__ == "__main__":
main()
| def main():
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
nt = tuple(range(n))
kt = tuple(range(1, k + 1))
h = tuple(map(int, input().split()))
dp = [10 ** 9] * n
dp[0] = 0
for i in nt:
for j in kt:
i_j = i + j
if i_j < n:
x = dp[i] + abs(h[i] - h[i_j])
if dp[i_j] > x:
dp[i_j] = x
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):
# 現在の足場を1~K前の足場から求める
dp[i] = min([dp[j] + abs(h[j]-h[i]) for j in range(max(0,i-K),i)])
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] = min([dp[j] + abs(h[j]-h[i]) for j in range(max(0,i-K),i)])
print((dp[-1])) | p03161 |
n,k = list(map(int,input().split()))
li = list(map(int,input().split()))
ans = [0]*n
ans[0] = 0
for i in range(1,n):
l = []
if k > i:
for j in range(i):
l.append(abs(li[i]-li[j])+ans[j])
else:
for j in range(1,k+1):
l.append(abs(li[i]-li[i-j])+ans[i-j])
# print(l)
ans[i] = min(l)
print((ans[-1])) |
n,k = list(map(int,input().split()))
li = list(map(int,input().split()))
ans = [0]*n
# 地味に遅い
# for i in range(1,n):
# l = []
# if k > i:
# for j in range(i):
# l.append(abs(li[i]-li[j])+ans[j])
# else:
# for j in range(1,k+1):
# l.append(abs(li[i]-li[i-j])+ans[i-j])
# ans[i] = min(l)
# print(ans[-1])
for i in range(1,n):
l = [ abs(li[i]-li[j]) + ans[j] for j in range(max(0,i-k),i)]
# print(l)
ans[i] = min(l)
print((ans[-1])) | p03161 |
inf = float('inf')
n,k=list(map(int,input().split()))
h = list(map(int,input().split()))
dp=[0] + [inf] *(n-1)#初期化
for i in range(1,n):
for j in range(1,k+1):#iからj離れた場所から来る場合と比較
if i >=j:
dp[i] = min(dp[i],abs(h[i-j]-h[i])+dp[i-j])
else:break
print((dp[n-1])) | def main():
inf = float('inf')
n,k=list(map(int,input().split()))
h = list(map(int,input().split()))
dp=[0] + [inf] *(n-1)#初期化
for i in range(1,n):
for j in range(1,k+1):#iからj離れた場所から来る場合と比較
if i >=j:
dp[i] = min(dp[i],abs(h[i-j]-h[i])+dp[i-j])
else:break
print((dp[n-1]))
if __name__ == '__main__':
main() | p03161 |
# 参考: https://cinnamo-coder.hatenablog.com/entry/2019/05/11/191130
n, k = list(map(int, input().split()))
lst_h = list(map(int, input().split()))
# 1. DP[i] は、足場 i に到達するための最小コストと定義する
# 2. 状態遷移は min を使う
# 3. DPの初期化は、最小値を求めるので INF とする（足場1は例外）。
dp = [float("INF")] * n
dp[0] = 0
for i in range(n):
for j in range(1, k + 1):
# n 番目の足場を跳び越したら、次の足場を調べる
if i + j > n - 1:
break
# 既存の dp[i + j] と、新たに計算する dp[i + j] の大小比較
dp[i + j] = min(dp[i + j], dp[i] + abs(lst_h[i] - lst_h[i + j]))
# 計算量 O(nk)
ans = dp[n - 1]
print(ans) | n, k = list(map(int, input().split()))
lst_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 > n - 1:
break
dp[i + j] = min(dp[i + j], dp[i] + abs(lst_h[i] - lst_h[i + j]))
ans = dp[n - 1]
print(ans) | p03161 |
_, k = list(map(int, input().split()))
h = list(map(int, input().split()))
opt = [0] * len(h)
for i in range(1,len(h)):
opt[i] = min([opt[i-j] + abs(h[i-j] - h[i]) for j in range(1,min(i,k)+1)])
print((opt[-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
opt = [0]
for i in range(1,n):
opt += [min([opt[-j] + abs(h[i-j] - h[i]) for j in range(1,min(i,k)+1)])]
print((opt[-1])) | p03161 |
import sys
N, K = list(map(int, sys.stdin.readline().split()))
A = list(map(int, sys.stdin.readline().split()))
dp = [0] + [None] * (N - 1)
for n in range(1, N):
l = max(0, n - K)
dp[n] = min(abs(A[n] - a) + d for a, d in zip(A[l : n], dp[l : n]))
print((dp[-1]))
| import sys
N, K = list(map(int, sys.stdin.readline().split()))
A = list(map(int, sys.stdin.readline().split()))
dp = [0] + [None] * (N - 1)
for n, a in enumerate(A):
if n:
l = max(0, n - K)
dp[n] = min(abs(a - a2) + d for a2, d in zip(A[l : n], dp[l : n]))
print((dp[-1]))
| p03161 |
def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0] * n
for i in range(1, n):
h = a[i]
dp[i] = min([dp[j] + abs(h - a[j]) for j in range(max(0, i-k), i)])
print((dp[n-1]))
main() | def main():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0] * n
for i in range(1, n):
h = a[i]
cost = 10**9
for j in range(max(0, i-k), i):
if dp[j] + abs(h - a[j]) < cost:
cost = dp[j] + abs(h - a[j])
dp[i] = cost
print((dp[n-1]))
main() | p03161 |
n, k = list(map(int, input().split()))
dat_h = list(map(int, input().split()))
dp = [100000000000] * (n + 1)
dp[0] = 0
for i in range(1, n):
#print("i:{0}", i)
for j in range(1, k + 1):
#print("j:{0}", j)
if (i - j) >= 0:
dp[i] = min(dp[i], dp[i-j] + abs(dat_h[i] - dat_h[i-j]))
#print(dp)
print((dp[n-1]))
| n, k = list(map(int, input().split()))
dat_h = list(map(int, input().split()))
dp = [1000000000000000] * (n + 1)
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(dat_h[i] - dat_h[i-j]))
print((dp[n-1])) | p03161 |
# EduDPB - Frog 2
n, k = list(map(int, input().rstrip().split()))
lst = list(map(int, input().rstrip().split()))
ans = [0] + [float("inf")] * (n - 1)
for i in range(n):
for j in range(1, k + 1):
if i + j >= n:
break
ans[i + j] = min(ans[i + j], ans[i] + abs(lst[i] - lst[i + j]))
print((ans[-1])) | # EduDPB - Frog 2
import sys
input = sys.stdin.readline
n, k = list(map(int, input().rstrip().split()))
lst = list(map(int, input().rstrip().split()))
ans = [0] + [float("inf")] * (n - 1)
for i in range(n):
for j in range(1, k + 1):
if i + j >= n:
break
ans[i + j] = min(ans[i + j], ans[i] + abs(lst[i] - lst[i + j]))
print((ans[-1]))
| p03161 |
# dpB - Frog 2
# 貰うDP
def main():
n, k = tuple(map(int, input().rstrip().split()))
A = tuple(map(int, input().rstrip().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(A[i] - A[i - j]))
print((dp[-1]))
if __name__ == "__main__":
main() | # dpB - Frog 2
# 配るDP
def main():
n, k = tuple(map(int, input().rstrip().split()))
A = tuple(map(int, input().rstrip().split()))
dp = [float("inf")] * 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 + j], dp[i] + abs(A[i] - A[i + j]))
print((dp[-1]))
if __name__ == "__main__":
main() | p03161 |
#!/usr/bin/env python3
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 10**12
dp = [INF] * (N+1)
dp[1] = 0
for i in range(1,N):
for j in range(1,K+1):
if i+j > N:
break
else:
dp[i+j] = min(dp[i+j],dp[i]+abs(h[i-1]-h[i+j-1]))
print((dp[N]))
if __name__ == "__main__":
main()
| def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 10**12
dp = [INF] * (N+1)
dp[1] = 0
for i in range(1,N):
for j in range(1,K+1):
if i+j > N:
break
else:
dp[i+j] = min(dp[i+j],dp[i]+abs(h[i-1]-h[i+j-1]))
print((dp[N]))
if __name__ == "__main__":
main() | p03161 |
import sys
stdin = sys.stdin
mod = 1000000007
inf = 1 << 60
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
n, k = na()
h = na()
dp = [inf] * 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 + j], dp[i] + abs(h[i] - h[i + j]))
print((dp[n - 1]))
| n, k = list(map(int,input().split()))
pedras = list(map(int,input().split()))
INF = 1e12
dp = [INF] * n
dp[0] = 0
dp[1] = abs(pedras[1] - pedras[0])
for i in range(2,n):
pulo = 0
for j in range(i-1,-1,-1):
pulo += 1
if pulo > k:
break
else:
dp[i] = min(dp[i], dp[j] + abs(pedras[i] - pedras[j]))
print((dp[n-1]))
| p03161 |
n,k = list(map(int, input().split()))
H = [0]+list(map(int, input().split()))
dp = [float("inf")]*(n+1)
dp[0] = 0
dp[1] = 0
for i in range(n):
for k_i in range(1, k+1):
if i+k_i<=n:
dp[i+k_i] = min(dp[i+k_i], dp[i]+abs(H[i+k_i]-H[i]))
print((dp[-1])) | n,k = list(map(int, input().split()))
H = [0]+list(map(int, input().split()))
dp = [float("inf")]*(n+1)
dp[0] = 0
dp[1] = 0
for i in range(1, n):
for k_i in range(1, k+1):
if i+k_i<=n:
dp[i+k_i] = min(dp[i+k_i], dp[i]+abs(H[i+k_i]-H[i]))
print((dp[-1])) | p03161 |
def resolve():
# N: 足場の個数, K: 1回で右にジャンプできる足場の数
N, K = list(map(int, input().split()))
# h: 各足場の高さ
# dpテーブル宣言: dp[今いる足場の番号-1]=[最小コスト, 足場の高さ]
dp = [
[float('inf'), int(h_)]
for h_ in input().split()
]
dp[0][0] = 0
dp[1][0] = abs(dp[0][1] - dp[1][1])
# k個左の足場からジャンプして来た時の最小コストを調べる
for n in range(2, N):
index_0 = max(0, n-K)
h_ = dp[n][1]
dp[n][0] = min(
[
abs( h_ - dp_[1] ) + dp_[0]
for dp_ in dp[index_0:n]
]
)
print((dp[N-1][0]))
resolve() | def resolve():
# N: 足場の個数, K: 1回で右にジャンプできる足場の数
N, K = list(map(int, input().split()))
# h: 各足場の高さ
# dpテーブル宣言: dp[今いる足場の番号-1]=[最小コスト, 足場の高さ]
dp = [
[float('inf'), int(h_)]
for h_ in input().split()
]
dp[0][0] = 0
dp[1][0] = abs(dp[0][1] - dp[1][1])
# k個左の足場からジャンプして来た時の最小コストを調べる
for n in range(2, N):
height_current = dp[n][1]
dp[n][0] = min(
[
abs( height_current - height ) + cost
for cost,height in dp[max(0, n-K):n]
]
)
print((dp[N-1][0]))
resolve() | p03161 |
#!/usr/bin/env python3
import sys
def solve(N: int, K: int, h: "List[int]"):
dp=[2**60]*N
dp[0]=0
cost=[[0]*N for _ in range(N)]
for i in range(N):
for j in range(i):
cost[i][j]=abs(h[i]-h[j])
for i in range(1,N):
for st in range(max(0,i-K), i):
dp[i]=min(dp[i], dp[st]+cost[i][st])
print((dp[N-1]))
return
# Generated by 1.1.6 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]"
solve(N, K, h)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, K: int, h: "List[int]"):
dp=[2**60]*N
dp[0]=0
for i in range(1,N):
for st in range(max(0,i-K), i):
dp[i]=min(dp[i], dp[st]+abs(h[st]-h[i]))
print((dp[N-1]))
return
# Generated by 1.1.6 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]"
solve(N, K, h)
if __name__ == '__main__':
main() | p03161 |
import math
n,k=list(map(int,input().split()))
a=[int(i) for i in input().split()]
b=[0]*n
b[n-2]=abs(a[n-1]-a[n-2])
for i in range(n-3,-1,-1):
c=[]
for j in range(i+1,min(n,i+k+1)):
c.append(abs(a[j]-a[i])+b[j])
b[i]=min(c)
print((b[0])) | n,k=list(map(int,input().split()))
a=[int(i) for i in input().split()]
b=[0]*n
b[n-2]=abs(a[n-1]-a[n-2])
for i in range(n-3,-1,-1):
mini=1000000000000000
for j in range(i+1,min(n,i+k+1)):
x=abs(a[j]-a[i])+b[j]
mini=min(mini,x)
b[i]=mini
print((b[0])) | p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
INF=10**9
dp=[INF for i in range(n)]
dp[0]=0
if k>n-1:
k=n-1
for i in range(1,n):
for j in range(1,k+1):
if i-j>=0:
dp[i]=min(dp[i-j]+abs(h[i]-h[i-j]),dp[i])
print((dp[-1])) | n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
INF=10**9
dp=[INF for i in range(n)]
dp[0]=0
if k>n-1:
k=n-1
for i in range(1,n):
for j in range(1,k+1):
if i-j<0:
break
dp[i]=min(dp[i-j]+abs(h[i]-h[i-j]),dp[i])
print((dp[-1])) | p03161 |
n,k = list(map(int,input().split()))
h = [int(i) for i in 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(0,i-k),i))
print((dp[-1])) | def solve():
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [float("inf")]*n
dp[0] = 0
for i in range(0,n-1):
for j in range(1,k+1):
if (i-j)>=-1:
dp[i+1]=min(dp[i+1],dp[i+1-j]+abs(h[i+1]-h[i+1-j]))
print((dp[-1]))
solve()
| p03161 |
n, k = list(map(int, input().split()))
h = [int(i) for i in input().split()]
dp = [0] * n
for i in range(n):
dp_temp = 0
for j in range(1, k+1):
if i-j > -1:
temp = dp[i-j] + abs(h[i]-h[i-j])
if dp_temp == 0:
dp_temp = temp
else:
if dp_temp > temp:
dp_temp = temp
else:
break
dp[i] = dp_temp
print((dp[n-1]))
| n, k = list(map(int, input().split()))
h = [int(i) for i in input().split()]
dp = [0] * n
for i in range(n):
dp_temp = 0
flag = 0
for j in range(1, k+1):
if i-j >= 0:
temp = dp[i-j] + abs(h[i]-h[i-j])
if flag == 0:
dp_temp = temp
flag = 1
else:
if dp_temp >= temp:
dp_temp = temp
else:
break
dp[i] = dp_temp
print((dp[n-1]))
| p03161 |
N_K=list(map(int,input().split()))
N=N_K[0]
K=N_K[1]
cost=list(map(int,input().split()))
#cost=[int(input()) for i in range(N)]
answers={0:0,1:abs(cost[1]-cost[0])}
if K==1:
S=0
for i in range(N-1):
S += abs(cost[i]-cost[i+1])
print (S)
else:
for i in range(2,N):
comp=[]
if i<K:
comp=[answers[i-j]+abs(cost[i]-cost[i-j]) for j in range(1,i+1)]
answers[i]=min(comp)
else:
comp=[answers[i-j]+abs(cost[i]-cost[i-j]) for j in range(1,K+1)]
answers[i]=min(comp)
print((answers[N-1])) | N_K=list(map(int,input().split()))
N=N_K[0]
K=N_K[1]
cost=list(map(int,input().split()))
answers=[0,abs(cost[1]-cost[0])]
if K==1:
S=0
for i in range(N-1):
S += abs(cost[i]-cost[i+1])
print (S)
else:
for i in range(2,N):
comp=[]
if i<K:
comp=[answers[i-j]+abs(cost[i]-cost[i-j]) for j in range(1,i+1)]
answers.append(min(comp))
else:
comp=[answers[i-j]+abs(cost[i]-cost[i-j]) for j in range(1,K+1)]
answers.append(min(comp))
print((answers[-1])) | p03161 |
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[-1]))
| import sys
input=sys.stdin.readline
def main():
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[-1]))
main() | p03161 |
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[1] = abs(H[1] - H[0])
for i in range(2,N):
dp[i] = min(dp[i-j] + abs(H[i] - H[i-j]) for j in range(1,max(K,i)))
print((dp[-1]))
if __name__ == "__main__":
main() | 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[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))
print((dp[-1]))
if __name__ == "__main__":
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(1,N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(i-K, 0), i))
print((dp[-1])) | 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 |
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[i-j]+abs(h[i] - h[i-j]) for j in range(1,min(K,i)+1))
print((dp[N-1]))
if __name__ == '__main__':
test() | 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[N-1]))
if __name__ == '__main__':
test() | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10 ** 4 + 1
dp = [inf] * N
dp[0] = 0
for i in range(1,N):
H = h[i]
dp[i] = min( [dp[j] + abs(h[j] - H) for j in range(max(0, i-K),i)])
print((dp[-1]))
| N,K=list(map(int, input().split()))
H=list(map(int, input().split()))
if N-1<=K:
print((abs(H[N-1]-H[0])))
exit()
inf=10**4+1
dp=[inf]*N
dp[0]=0
for i,h in enumerate(H):
if i == 0:continue
m=inf
M=max(0,i-K)
dp[i]=min([dpt+abs(h-ht) for ht,dpt in zip(H[M:i],dp[M: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(0,i-K), i))
print((dp[-1])) | 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 |
n, k = list(map(int, input().split()))
li_h = list(map(int, input().split()))
li_cost = [float("inf")] * n
li_cost[0] = 0
# i = 現在の足場
for i in range(n):
#for a in range(1, k + 1):
w = min(k + 1, n - i)
for a in range(1, w):
if i + a < n:
li_cost[i + a] = min(abs(li_h[i] - li_h[i + a]) + li_cost[i], li_cost[i + a])
print((li_cost[-1]))
| n, k = list(map(int, input().split()))
li_h = list(map(int, input().split()))
dp = [float("inf")] * n
dp[0] = 0
for i in range(1, n):
w = i - k if i - k > 0 else 0
dp[i] = min([cost + abs(height - li_h[i]) for cost, height in zip(dp[w:i], li_h[w:i])])
print((dp[-1]))
| p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [1e9] * n
dp[0] = 0
for i in range(n):
for j in range(i + 1, i + k + 1, 1):
if j < n:
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]))
print((dp[n - 1])) | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0] * n
for i in range(1, n):
dp[i] = min(dp[j] + abs(a[i] - a[j])
for j in range(i - 1, max(i - k - 1, -1), -1))
print((dp[-1]))
| p03161 |
def main():
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))+[0]*(k+10)
dp=[(float("inf")) for i in range(n+k+10)]
dp[0]=0
for i in range(n-1):
for j in range(k):
dp[i+j+1]=min(dp[i]+abs(h[i]-h[i+j+1]),dp[i+j+1])
return (dp[n-1])
print((main()))
| n,k,*h=list(map(int,open(0).read().split()))
INF=float("inf")
dp=[INF]*(n)
dp[0]=0
for i in range(n):
for j in range(1,k+1):
try:
dp[i+j]=min(dp[i+j],dp[i]+abs(h[i+j]-h[i]))
except:
pass
# if not i-1<0:
# dp[i]=min(dp[i],dp[i-1]+abs(h[i]-h[i-1]))
# if not i-2<0:
# dp[i]=min(dp[i],dp[i-2]+abs(h[i]-h[i-2]))
print((dp[-1])) | 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])) | import sys
input = sys.stdin.readline
def Main(N, K, h):
dp =[float('inf')]*N
dp[0] = 0
for i in range(N):
for j in range(1, min(N-i,K+1)):
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i] - h[i+j]))
return dp[N-1]
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
print((Main(N, K, h)))
if __name__ == '__main__':
main() | p03161 |
# https://atcoder.jp/contests/dp/tasks/dp_b
N,K = list(map(int,input().split()))
h = [int(x) for x in input().split()]
dp = [0] * (N)
dp[0] = 0
# 参考：https://atcoder.jp/contests/dp/submissions/10181844
for i in range(1, N):
tmp = [dp[k] + abs(h[i] - h[k]) for k in range(max(0, i - K), i)]
dp[i] = min(tmp)
print((dp[-1]))
| # https://atcoder.jp/contests/dp/tasks/dp_b
def main():
N, K = list(map(int, input().split()))
h = [int(x) for x in input().split()]
dp = [0] * (N)
dp[0] = 0
# 参考：https://atcoder.jp/contests/dp/submissions/10181844
for i in range(1, N):
tmp = [dp[k] + abs(h[i] - h[k]) for k in range(max(0, i - K), i)]
dp[i] = min(tmp)
print((dp[-1]))
if __name__ == '__main__':
main()
| p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0]+[None]*(N-1)
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]+[None]*(N-1)
def func(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))
func(N,K,h,dp)
print((dp[-1])) | p03161 |
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
DP=[0]*(N)
DP[0]=0
DP[1]=abs(H[1]-H[0])
for i in range(2,N):
DP[i]=min([abs(H[i]-H[k])+DP[k] for k in range(max(i-K,0),i)])
print((DP[N-1])) | N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
cost =10**10
DP=[0]*(N+10)
DP[0]=0
DP[1]=abs(H[1]-H[0])
for i in range(2,N):
cost=10**10
for k in range(max(i-K,0),i):
cost=min(cost,(abs(H[i]-H[k])+DP[k]))
DP[i]=cost
print((DP[N-1])) | p03161 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split())) + [0] * (n*k)
dp = [float('inf')] * (n*k + 1)
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] - h[i+j]))
print((dp[n-1]))
| n,k = list(map(int,input().split()))
h = list(map(int,input().split())) + [0] * (k)
dp = [float('inf')] * (n*k + 1)
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] - h[i+j]))
print((dp[n-1]))
| p03161 |
# -*- coding: utf-8 -*-
"""
Created on Tue Jan 21 16:49:00 2020
@author: matsui
"""
def cost(i,j):
return abs(h[i]-h[j])
N,K=list(map(int,input().split()))
h=[int(num) for num in input().split()]
dp=[0]*N
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])) | # -*- coding: utf-8 -*-
"""
Created on Tue Jan 21 16:49:00 2020
@author: matsui
"""
N,K=list(map(int,input().split()))
h=[int(num) for num in input().split()]
dp=[0]*N
dp[1]=abs(h[0]-h[1])
def cost(h,N,K,dp):
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)])
return dp[-1]
print((cost(h,N,K,dp))) | p03161 |
# -*- coding: utf-8 -*-
"""
Created on Tue Jan 21 16:49:00 2020
@author: matsui
"""
def cost(h,N,K):
dp=[0]*N
for i in range(1,N):
tmp=[]
for j in range(1,K+1):
if i-j < 0 : break
tmp.append(abs(h[i]-h[i-j])+dp[i-j])
dp[i]=min(tmp)
return dp[-1]
N,K=list(map(int,input().split()))
h=[int(num) for num in input().split()]
print((cost(h,N,K))) | # -*- coding: utf-8 -*-
"""
Created on Tue Jan 21 16:49:00 2020
@author: matsui
"""
def cost(h,N,K):
dp=[0]*N
dp[1]=abs(h[0]-h[1])
for i in range(2,N):
tmp=[abs(h[i]-h[j])+dp[j] for j in range(max(0,i-K),i)]
dp[i]=min(tmp)
return dp[-1]
N,K=list(map(int,input().split()))
h=[int(num) for num in input().split()]
print((cost(h,N,K))) | p03161 |
N, K = list(map(int, input().split()))
h = [int(x) for x in input().split()]
inf = 10 ** 5
Cost = [inf] * N
Cost[0] = 0
for i in range(1, N):
tmp = [Cost[i - k] + abs(h[i] - h[i - k]) if i - k >= 0 else inf for k in range(1,K + 1)]
Cost[i] = min(tmp)
print((Cost[-1])) | N, K = list(map(int, input().split()))
h = [int(x) for x in input().split()]
Cost = [0] * N
Cost[0] = 0
for i in range(1, N):
tmp = [Cost[k] + abs(h[i] - h[k]) for k in range(max(0, i - K),i)]
Cost[i] = min(tmp)
print((Cost[-1])) | p03161 |
N, K = list(map(int, input().split()))
h = [int(i) for i in input().split()]
dp = [0] * N
for i in range(1, N):
c = 10 ** 4 * N
j=0 if i<K else i-K
H = h[i]
for k,l in zip(dp[j:i], h[j:i]):
c1 = k + abs(l-H)
c = min(c1, c)
dp[i] = c
print((dp[-1])) | N, K = list(map(int, input().split()))
h = [int(i) for i in input().split()]
dp = [0] * N
for i,H in enumerate(h):
if i != 0:
j=0 if i<K else i-K
dp[i] = min(k + abs(l-H) for k,l 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 = [[100000 for i in range(n)]for j in range(n)]
for i in range(n):
for j in range(k+1):
if i+j<n:
if i == 0:
dp[i][j] = abs(h[j]-h[0])
else:
dp[i][i+j] = min(dp[i-1][i] + abs(h[i] - h[i + j]), dp[i-1][i+j])
print((dp[n-1][n-1])) | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [1000000000 for i in range(n)]
dp[0] = 0
for i in range(n):
for j in range(k+1):
if i+j<n:
dp[i + j] = min(dp[i] + abs(h[i] - h[i + j]), dp[i + j])
print((dp[n-1])) | p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [float('inf')]*(N+10000)
dp[0] = 0
for i in range(N):
for j in range(K+1):
try:
dp[i+j] = min(dp[i]+abs(h[i]-h[i+j]),dp[i+j])
except Exception:
continue
print((dp[N-1])) | N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [float('inf')]*(N+K)
dp[0] = 0
for i in range(N):
for j in range(K+1):
try:
dp[i+j] = min(dp[i]+abs(h[i]-h[i+j]),dp[i+j])
except Exception:
break
print((dp[N-1])) | p03161 |
#B
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
cost = [float('inf')]*n
for i in range(n):
if i == 0:
cost[i] = 0
continue
for j in range(1,k+1):
if i-j>=0:
cost[i] = min(cost[i],cost[i-j]+abs(h[i]-h[i-j]))
print((cost[n-1])) | #B
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [float('inf')]*n
for i in range(n):
if i == 0:
dp[i] = 0
continue
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):
L = [dp[j] +abs(h[i] - h[j]) for j in range(max(0,i-K),i)]
dp[i] = min(L)
print((dp[-1])) | N,K = list(map(int,input().split()))
H = [int(x) for x in input().split()]
def main(N,K,H):
dp = [0]*N
for i in range(1,N):
L = [dp[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i)]
dp[i] = min(L)
print((dp[-1]))
main(N,K,H) | p03161 |
N,K = list(map(int,input().split()))
H = [int(x) for x in input().split()]
def main(N,K,H):
dp = [0]*N
for i in range(1,N):
L = [dp[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i)]
dp[i] = min(L)
print((dp[-1]))
main(N,K,H) | N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
def main(N,K,H):
dp = [0]*N
for i in range(1,N):
L = [dp[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i)]
dp[i] = min(L)
print((dp[-1]))
main(N,K,H) | 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):
a = (dp[j] + abs(h[i] - h[j]) for j in range(max(0,i-k),i))
dp[i] = min(a)
print((dp[-1]))
main()
| n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * n
for i in range(1,n):
a = []
if i-k < 0:
start = 0
else:
start = i-k
for j in range(start,i):
a.append(dp[j] + abs(h[i] - h[j]))
dp[i] = min(a)
print((dp[-1]))
| p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
a = [0]*n
for i in range(1, n):
a[i] = min([a[j] + abs(h[i]-h[j]) for j in range(max(0, i-k), i)])
print((a[-1])) | n, k = list(map(int, input().split()))
hs = list(map(int, input().split()))
dp = [0]*n
for i in range(1, n):
first = max(0, i-k)
dp[i] = min([d + abs(hs[i]-h) for d, h in zip(dp[first:i], hs[first:i])])
print((dp[-1])) | p03161 |
INF = float("inf") #const
def main():
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [INF]*n
dp[0] = 0
for i in range(n):
for j in range(1,k+1):
if i+j >= n:
break
else:
dp[i+j] = min(dp[i+j],dp[i] + abs(h[i]-h[i+j]))
print((dp[n-1]))
if __name__ == "__main__":
main()
| INF = float("inf") #const
def main():
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [INF]*n
dp[0] = 0
for i in range(n):
res = dp[i]
for j in range(1,k+1):
if i+j >= n:
break
else:
dp[i+j] = min(dp[i+j],res + abs(h[i]-h[i+j]))
print((dp[n-1]))
if __name__ == "__main__":
main()
| p03161 |
INF = float("inf") #const
def main():
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [INF]*n
dp[0] = 0
for i in range(n):
res = dp[i]
for j in range(1,k+1):
if i+j >= n:
break
else:
dp[i+j] = min(dp[i+j],res + abs(h[i]-h[i+j]))
print((dp[n-1]))
if __name__ == "__main__":
main()
| INF = float("inf") #const
MOD = 10**9+7 #const
MAX = 510000 #const
def main():
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [INF]*(n+1)
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]))
if __name__ == "__main__":
main()
| p03161 |
def main():
n, k = list(map(int, input().split()))
s = list(map(int, input().split()))
inf = 10 ** 8
dp = [inf] * n
dp[0] = 0
for j in range(1, n):
buf = [dp[i] + abs(s[j]-s[i]) for i in range(max(0, j - k), j)]
dp[j] = min(buf)
print((dp[-1]))
if __name__ == "__main__":
main()
| n, k = list(map(int, input().split()))
s = list(map(int, input().split()))
inf = 10 ** 8
dp = [inf] * n
dp[0] = 0
for j in range(1, n):
buf = [dp[i] + abs(s[j]-s[i]) for i in range(max(0, j - k), j)]
dp[j] = min(buf)
print((dp[-1]))
| p03161 |
N , K = list(map(int,input().split()))
h = list(map(int,input().split()))
def dp(cost):
for x in range(1,N):
cost[x] = min( [ cost[x-k-1] + abs( h[x] - h[x-k-1] ) for k in range(0,min(x,K)) ] )
return 0
def solve():
cost = [float('inf')] * N
cost[0] = 0
dp(cost)
print((cost[N-1]))
return 0
if __name__ == "__main__":
solve() | N , K = list(map(int,input().split()))
h = list(map(int,input().split()))
def dp(cost):
for x in range(1,N):
cost[x] = min( [ cost[k] + abs( h[x] - h[k] ) for k in range(max(x-K,0),x) ] )
return 0
def solve():
cost = [float('inf')] * N
cost[0] = 0
dp(cost)
print((cost[N-1]))
return 0
if __name__ == "__main__":
solve() | p03161 |
n,k = list(map(int,input().split()))
h_ls = list(map(int, input().split()))
dp = [float('inf') for _ 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+j], dp[i] + abs(h_ls[i+j] - h_ls[i]))
print((dp[-1])) | n,k = list(map(int,input().split()))
h_ls = list(map(int, input().split()))
mincost_ls = [float('inf')] * n
mincost_ls[0] = 0
for i in range(n):
for j in range(i+1,i+k+1):
if j < n:
mincost_ls[j] = min(mincost_ls[j], mincost_ls[i] + abs(h_ls[j]-h_ls[i]))
print((mincost_ls[-1]))
| p03161 |
n,k = list(map(int,input().split()))
h_ls = list(map(int, input().split()))
mincost_ls = [float('inf')] * n
mincost_ls[0] = 0
for i in range(n):
for j in range(i+1,i+k+1):
if j < n:
mincost_ls[j] = min(mincost_ls[j], mincost_ls[i] + abs(h_ls[j]-h_ls[i]))
print((mincost_ls[-1]))
| n,k = list(map(int,input().split()))
h_ls = list(map(int, input().split()))
mincost_ls = [float('inf')] * n
mincost_ls[0] = 0
for i in range(n):
for j in range(1,k+1):
if i+j < n:
mincost_ls[i+j] = min(mincost_ls[i+j], mincost_ls[i] + abs(h_ls[i+j]-h_ls[i]))
print((mincost_ls[-1]))
| p03161 |
n, k = list(map(int,input().split()))
h = list(map(int,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(k+1):
if i - j < 0:
continue
dp[i] = min(dp[i-j]+abs(h[i]-h[i-j]),dp[i])
print((dp[-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(n):
for j in range(k+1):
if i + j < n:
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print((dp[-1])) | p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
INF = 100100100100100
dp = [INF]*N
dp[0] = 0
for i in range(1,N):
for k in range(1,K+1):
if i >= k:
dp[i] = min(dp[i], dp[i-k] + abs(h[i] - h[i-k]))
print((dp[N-1])) | N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
INF = 100100100100100
dp = [INF]*N
dp[0] = 0
for i in range(1,N):
for k in range(1,K+1):
if i < k:
break
dp[i] = min(dp[i], dp[i-k] + abs(h[i] - h[i-k]))
print((dp[N-1])) | p03161 |
#!/usr/bin/env python3
import sys
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
def solve(N: int, K: int, h: "List[int]"):
dp = [float('inf')] * 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+j], dp[i] + abs(h[i] - h[i+j]))
return dp[-1]
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]"
result = solve(N, K, h)
if isinstance(result, Iterable) and not isinstance(result, str):
result = '\n'.join([str(v) for v in result])
print(result)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
from math import gcd
except Exception:
from fractions import gcd
def solve(N: int, K: int, h: "List[int]"):
dp = [float('inf')] * 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+j], dp[i] + abs(h[i] - h[i+j]))
return dp[-1]
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]"
result = solve(N, K, h)
print(result)
if __name__ == '__main__':
main() | p03161 |
import math
import string
import collections
from collections import Counter
from collections import deque
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))
def has_duplicates2(seq):
seen = []
for item in seq:
if not(item in seen):
seen.append(item)
return len(seq) != len(seen)
def divisor(n):
divisor = []
for i in range(1, n+1):
if n % i == 0:
divisor.append(i)
return divisor
# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
n, k = list(map(int, input().split()))
h = readints()
h.append(-1)
dp = [10**9]*(2*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+j], abs(h[i]-h[i+j])+dp[i])
print((dp[n-1]))
| import math
import string
import collections
from collections import Counter
from collections import deque
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))
def has_duplicates2(seq):
seen = []
for item in seq:
if not(item in seen):
seen.append(item)
return len(seq) != len(seen)
def divisor(n):
divisor = []
for i in range(1, n+1):
if n % i == 0:
divisor.append(i)
return divisor
# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
n, k = list(map(int, input().split()))
h = readints()
# h.append(-1)
dp = [10**9]*(2*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+j], abs(h[i]-h[i+j])+dp[i])
print((dp[n-1]))
| p03161 |
import sys
def resolve():
readline = sys.stdin.readline # 1行だけ文字列にする
N, K = list(map(int, readline().split()))
h = [int(x) for x in readline().split()]
inf = float('inf')
dp = [inf] * N
dp[0] = 0
for i in range(1, N):
if i < K:
for j in range(i + 1):
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
else:
for j in range(K + 1):
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print((dp[N - 1]))
resolve()
| def resolve():
import sys
readline = sys.stdin.readline
N, K = list(map(int, readline().split()))
h = [int(x) for x in readline().split()]
inf = float('inf')
dp = [inf] * N
dp[0] = 0
for i in range(1, N):
leng = i + 1 if i < K else K + 1
for j in range(leng):
cal = dp[i - j] + abs(h[i] - h[i - j])
if dp[i] > cal:
dp[i] = cal
print((dp[-1]))
resolve()
| p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
mem = [[-1 for _ in range(N)] for _ in range(N)]
dp = [0] * N
dp[1] = abs(H[1]-H[0])
for i in range(2, N):
l = []
for k in range(1, 1+K):
if i-k >= 0:
if mem[i-k][i] != -1:
d = mem[i-k][i]
else:
d = abs(H[i - k] - H[i])
mem[i-k][i] = d
l.append(dp[i-k] + d)
if len(l) > 0:
dp[i] = min(l)
else:
dp[i] = 0
print((dp[-1])) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0] * N
dp[1] = abs(H[1]-H[0])
for i in range(2, N):
dp[i] = min([dp[i-k] + abs(H[i-k]-H[i]) for k in range(1, 1+K) if 0 <= i-k])
print((dp[-1])) | p03161 |
inf = 10**9 + 7
n, k = list(map(int, input().split()))
nodes = list(map(int, input().split()))
dp = [inf] * n
dp[0] = 0
# for i in range(n):
# for j in range(i+1, min(i+k+1, n)):
# dp[j] = min(dp[j], dp[i] + abs(nodes[i] - nodes[j]))
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(nodes[i]-nodes[i+j]))
print((dp[n-1]))
| inf = 10**9 + 7
n, k = list(map(int, input().split()))
nodes = list(map(int, input().split()))
dp = [inf] * n
dp[0] = 0
for i in range(n):
for j in range(i+1, min(i+k+1, n)):
dp[j] = min(dp[j], dp[i] + abs(nodes[i] - nodes[j]))
# 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(nodes[i]-nodes[i+j]))
print((dp[n-1]))
| p03161 |
import math
def solve(a,n,k):
dp = [0]*(n)
dp[0]=0
inf = 10**9
for i in range(1,n):
dp[i]=inf
r=max(0,i-k)
for j in range(r,i):
dp[i]=min(dp[i],abs(a[i]-a[j])+dp[j])
#print(dp)
return dp[n-1]
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
print((solve(a,n,k)))
| import math
def solve(a,n,k):
dp = [0]*(n)
dp[0]=0
inf = 10**9
for i in range(1,n):
dp[i]=inf
r=max(0,i-k)
dp[i]=min([abs(a[i]-a[j])+dp[j] for j in range(r,i)])
#print(dp)
return dp[-1]
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
print((solve(a,n,k))) | p03161 |
n,k = list(map(int,input().split()))
h = list(map(int, input().split()))
cnt = [float('inf')]*n
cnt[0], cnt[1] = 0, abs(h[0]-h[1])
for i in range(2, n):
cnt[i] = min(abs(h[m]-h[i])+cnt[m] for m in range(max(0,i-k),i))
print((cnt[n-1]))
| n,k = list(map(int,input().split()))
h = list(map(int, input().split()))
cnt = [0]*n
for i in range(1, n):
j = max(0,i-k)
cnt[i] = min(abs(h[m]-h[i])+cnt[m] for m in range(j,i))
print((cnt[n-1]))
| p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [1000000000] * N
dp[0] = 0
for i in range(N - 1):
for j in range(1, K + 1):
if i + j < N:
if dp[i + j] > abs(h[i + j] - h[i]) + dp[i]:
dp[i + j] = abs(h[i + j] - h[i]) + dp[i]
else:
break
print((dp[N - 1])) | N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [10**15+1 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+j],dp[i]+abs(h[i]-h[i+j]))
print((dp[-1])) | p03161 |
import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
kk=max(i-k,0)
dp[i]=min(d+abs(hh-h[i])for d,hh in zip(dp[kk:i],h[kk:i]))
print((dp[n-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-1]-h[i])
for j in range(2,min(k+1,i+1)):
dp[i]=min(dp[i],dp[i-j]+abs(h[i-j]-h[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=[0]*n
for i in range(1,n):
kk=max(i-k,0)
dp[i]=min(d+abs(hh-h[i])for d,hh in zip(dp[kk:i],h[kk:i]))
print((dp[n-1]))
| import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
kk=i-k
if kk<0:kk=0
dp[i]=min(d+abs(hh-h[i])for d,hh in zip(dp[kk:i],h[kk:i]))
print((dp[n-1])) | p03161 |
n,k=list(map(int,input().split()))
c=list(map(int,input().split()))
dp=[0 for i in range(n)]
for i in range(1,n):
dp[i]=min([dp[j]+abs(c[i]-c[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()))
a = [0] * n
a[0] = 0
for i in range(1, n):
a[i] = min([a[j] + abs(h[i] - h[j]) for j in range(max(0, i - k), i)])
print((a[-1]))
if __name__ == '__main__':
main()
| p03161 |
def main():
n,k=list(map(int,input().split()))
c=list(map(int,input().split()))
dp=[0]*n
dp[0]=0
for i in range(1,n):
dp[i]=min([dp[j]+abs(c[i]-c[j]) for j in range(max(0,i-k),i)])
print((dp[-1]))
if __name__=='__main__':
main() | n,k=list(map(int,input().split()))
c=list(map(int,input().split()))
dp=[0]*n
dp[0]=0
for i in range(1,n):
dp[i]=min([dp[j]+abs(c[i]-c[j]) for j in range(max(0,i-k),i)])
print((dp[-1])) | p03161 |
n, k, *h = list(map(int, open(0).read().split()))
dp = [float('inf')] * n
dp[0] = 0
for i in range(1, n):
min_i = max(0, i-k)
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(min_i, i)])
print((dp[n-1])) | def main():
n, k, *h = list(map(int, open(0).read().split()))
dp = [float('inf')] * n
dp[0] = 0
for i in range(1, n):
min_i = max(0, i-k)
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(min_i, i)])
print((dp[n-1]))
if __name__ == '__main__':
main() | p03161 |
a,aa=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[0]*a
c[0]=0
for i in range(1,a):
c[i] = min(c[j] + abs(b[i] - b[j]) for j in range(max(0,i-aa),i))
print((c[-1])) | def solve():
a,aa=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[0]*a
c[0]=0
for i in range(1,a):
c[i] = min(c[j] + abs(b[i] - b[j]) for j in range(max(0,i-aa),i))
print((c[-1]))
solve()
| p03161 |
n,k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [-1]*(n+1)
dp[0] = 0
for i in range(n-1):
for j in range(1,k+1):
if i+j==n:
break
if dp[i+j] == -1:
dp[i+j] = dp[i] + abs(h[i]-h[i+j])
else:
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 = [0]*(n)
dp[0] = 0
for i in range(1, n):
j = max(0, i-k)
dp[i] = min([dpk + abs(h[i]-hk) for dpk, hk in zip(dp[j:i], h[j:i])])
print((dp[n-1])) | p03161 |
def main():
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
inf = float("inf")
dp = [inf]*N
dp[0] = 0
steps = [inf] * K
for i in range(1, N):
steps = [inf] * K
for j in range(1, min(i, K) + 1):
steps[j-1] = abs(H[i-j]-H[i]) + dp[i-j]
step = min(steps)
dp[i] = min(dp[i], step)
print((dp[-1]))
if __name__ == "__main__":
main()
| def main():
import sys
input = sys.stdin.readline
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], abs(H[i+j]-H[i]) + dp[i])
print((dp[-1]))
if __name__ == "__main__":
main()
| p03161 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [100000000000 for _ in range(n)]
dp[0] = 0
for i in range(n):
for j in range(min(i+1,k+1)):
dp[i] = min(dp[i-j]+abs(h[i]-h[i-j]),dp[i])
print((dp[-1])) | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [100000000000 for _ in range(n)]
dp[0] = 0
for i in range(n):
for j in range(min(i,k)+1):
dp[i] = min(dp[i-j]+abs(h[i]-h[i-j]),dp[i])
print((dp[-1])) | p03161 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp=[1000000000]*n
dp[0]=0
for i in range(1,n):
for j in range(k):
if i > j:
dp[i] = min(dp[i],dp[i-j-1]+abs(h[i]-h[i-j-1]))
print((dp[-1])) | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp=[100000000000000000]*n
dp[0]=0
for i in range(1,n):
for j in range(k):
if i > j:
dp[i] = min(dp[i],dp[i-j-1]+abs(h[i]-h[i-j-1]))
print((dp[-1])) | p03161 |
def edu_dp_a_frog2():
n, k = list(map(int, input().split()))
h = list(map(int, 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, min(i+1, k+1)):
dp[i] = min(dp[i], dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1]))
edu_dp_a_frog2() | def edu_dp_a_frog2():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * n
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2, n):
dp[i] = min([dp[i-j]+abs(h[i]-h[i-j]) for j in range(1, min(i+1, k+1))])
# for j in range(1, min(i+1, k+1)):
# dp[i] = min(dp[i], dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1]))
edu_dp_a_frog2() | p03161 |
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
ans=[0]*N
for i in range(1,N):
ans[i]= min(abs(h[i]-h[j])+ans[j] for j in range(max(0,i-K),i))
print((ans[-1])) | def main():
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
ans=[0]*N
for i in range(1,N):
ans[i]= min(abs(h[i]-h[j])+ans[j] for j in range(max(0,i-K),i))
print((ans[-1]))
main() | p03161 |
N,K = list(map(int,input().split()))
H = [int(x) for x in input().split()]
dp = [0]*N
dp[0] = 0
dp[1] = abs(H[1]-H[0])
for i in range(2,N):
L = [dp[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i)]
dp[i] = min(L)
print((dp[N-1])) | N,K = list(map(int,input().split()))
H = [int(x) for x in input().split()]
def main(N,K,H):
dp = [0]*N
for i in range(1,N):
L = [dp[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i)]
dp[i] = min(L)
print((dp[-1]))
main(N,K,H) | p03161 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
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]))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
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 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N, K = MAP()
h = LIST()
dp = [INF]*N
dp[0] = 0
for i in range(N):
for j in range(1, K+1):
if i < N-j:
dp[i+j] = min(dp[i+j], dp[i]+abs(h[i+j]-h[i]))
# print(dp)
print((dp[-1])) | import sys, re
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
N, K = MAP()
h = LIST()
dp = [INF]*N
dp[0] = 0
for i in range(N):
for j in range(1, K+1):
if i < N-j:
dp[i+j] = min(dp[i+j], dp[i]+abs(h[i+j]-h[i]))
print((dp[-1]))
| p03161 |
def main():
n, k = list(map(int, input().split()))
stones = tuple(map(int, input().split()))
inf = 10**9
dp = [inf]*n
dp[0] = 0
for i in range(n):
for t in range(1, k+1):
if i+t < n:
v = dp[i]+abs(stones[i]-stones[i+t])
if dp[i+t] > v:
dp[i+t] = v
print((dp[-1]))
if __name__ == '__main__':
main()
| def main():
n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
INF = 10 ** 9
dp = [INF] * n
dp[0] = 0
for i in range(n):
for j in range(1, k + 1):
i_j = i + j
if i_j < n:
x = dp[i] + abs(h[i] - h[i_j])
if dp[i_j] > x:
dp[i_j] = x
print((dp[-1]))
if __name__ == "__main__":
main()
| p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = float('inf')
dp = [INF] * (1 + 10 ** 5)
dp[0] = 0
for i in range(n):
for j in range(k + 1):
if i - j < 0:continue
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 = float('inf')
dp = [INF] * (1 + 10 ** 5)
dp[0] = 0
for i in range(n):
for j in range(1, k + 1):
if i - j < 0:
continue
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print((dp[n-1])) | p03161 |
# ) .MMdMMM; .M#(,dM] .:
# ) .M@d@d#Mb dMGMM(MN .:
# ) dM1MCdbMM_ .M@MSN;dM- .:
# ) .M#(#?d#(Mb.. ...............JMIMIMLdM] .:
# ) ..M#?NHM# ?MMMMMMMMMH"""""""HMM@(Nad#(Mb .:
# ) .(MMMMH=..-(Jg[ ` daggmp MNm, .:
# ) ..MMY` !qN; (J ?MMN, .:
# ) (MMD` .MM@ .MM{ .WMN, .:
# ) dM@` dMM% .MM} (MMm .:
# ) .M#` dMN! .MM} ~(MMr .:
# ) .MM: dM# .MM} ..JM# .:
# ) `` .M@ dMF .MM} .~(M# ` . .:
# ) ?MMMMMMMNgJ, .7` T"! .JJjMNgNNMMMB^ .:
# ) dMr ?Mm, 7YYMM#!` .:
# ) dMb ?` ., ` .. ~.(MM% .:
# ) ..JgMMNNN) .Mn.(Mm-JM{ dHHMMNag., .:
# ) ("! ?MN,.., (NM@"`~OMM} ..~-(M@` _?"M[ .:
# ) ,MMM#_ .M# .M#` .~.~JMMMNg-.. .:
# ) ..gMB"?TMMNJ.. ` _` .~~.(JdM#^ _"TMMNgJ-, .:
# ) .gMB=` _7WMMNaJ... ....__-(JJgMMMM^ ?T"^ .:
# ) ............ ?TWMMMMNNNNgggggggggggggNNMMMMMMBY7`... .:
# ) WMMMMMMMMMMMMMNgJ, (dMMMM#"TYYYYYYMMMMMMMNgMMMMMMMMMMMNNgJ-, .:
# ) -?TMNmuuuuUWMMMMMMNNMM@g@MMmJ--_(JMMg@g@@gMMMMMMWUXXXUWMMMMMMNe. .:
import sys
input = sys.stdin.readline
def f(x,y):
if x in dic:
dic[x] = min(dic[x],y)
return
dic[x] = y
dic = {}
dic[0] = 0
n,k = list(map(int,input().split()))
h = tuple(map(int,input().split()))
for i in range(1,n):
for j in range(1,min(k,i)+1):
f(i,dic[i-j]+abs(h[i]-h[i-j]))
print((dic[n-1]))
| 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])) | p03161 |
def main():
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):
for j in range(1, min(k+1, n-i)):
num0 = h[i]-h[i+j]
if num0 < 0:
num0 *= -1
num = dp[i]+num0
if num < dp[i+j]:
dp[i+j] = num
print((dp[-1]))
main()
| def main():
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):
a = min(k+1, n-i)
for j in range(1, a):
num = dp[i]+abs(h[i]-h[i+j])
if num < dp[i+j]:
dp[i+j] = num
print((dp[-1]))
main()
| p03161 |
def main():
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):
a = min(k+1, n-i)
for j in range(1, a):
num = dp[i]+abs(h[i]-h[i+j])
if num < dp[i+j]:
dp[i+j] = num
print((dp[-1]))
main()
| def main():
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, min(k+1, n-i)):
num = dp[i]+abs(h[i]-h[i+j])
if num < dp[i+j]:
dp[i+j] = num
print((dp[-1]))
main()
| p03161 |
n, k = list(map(int, input().split()))
step = list(map(int, input().split()))
ans = [float('inf')]*(10**6)
ans[0] = 0
def dp(n):
for i in range(n):
for j in range(k+1):
if i+j < n:
ans[i+j] = min(ans[i+j], ans[i] + abs(step[i+j] - step[i]))
return ans[n-1]
print((dp(n))) | n, k = list(map(int, input().split()))
lst = list(map(int, input().split())) + [0]*k
ans = [float('inf')]*(n+k)
ans[0] = 0
def dp():
for i in range(n):
for j in range(1, k+1):
ans[i+j] = min(ans[i+j], ans[i] + abs(lst[i+j]-lst[i]))
dp()
print((ans[n-1])) | p03161 |
n,k = list(map(int,input().split()))
h = [int(i) for i in input().split()]
dp=[float('inf') for _ in range(n)]
dp[0]=0
def chmin(a,b):
if a>b:
a=b
return True
return False
for i in range(1,n):
for j in range(1,k+1):
if i-j<0:
break
else:
step= abs(h[i]-h[i-j])
dp[i] = min(dp[i],dp[i-j]+step)
print((dp[n-1])) | n,k = list(map(int,input().split()))
h = [int(i) for i in input().split()]
dp = [float('Inf') for i in range(n)]
dp[0]=0
for i in range(n):
for j in range(1,k+1):
if i-j<0:
break
dp[i]= min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1])) | p03161 |
import functools
import threading
import sys
class SearchProblem(object):
def __init__(self, N, H, K):
self.N = N
self.H = H
self.K = K
def isEnd(self, i):
return i == self.N
def succ(self, i):
return [
(i + k, abs(self.H[i + k] - self.H[i]))
for k in range(1, self.K + 1)
if i + k <= self.N
]
def solve(problem: SearchProblem):
@functools.lru_cache(maxsize=None)
def future_cost(s):
if problem.isEnd(s):
return 0
else:
return min(
cost + future_cost(next_state) for next_state, cost in problem.succ(s)
)
return future_cost(1)
def main():
N, K = [int(x) for x in input().split(" ")]
H = [None] + [int(x) for x in input().split(" ")]
problem = SearchProblem(N, H, K)
print((solve(problem)))
if __name__ == "__main__":
sys.setrecursionlimit(1024 * 1024 * 2)
threading.stack_size(128 * 1024 * 1024 * 2)
threading.Thread(target=main).start()
| import functools
import threading
import sys
def main():
@functools.lru_cache(maxsize=None)
def solve(n):
if n == 1:
return 0
else:
return min(
solve(n - k) + abs(H[n] - H[n - k])
for k in range(1, K + 1)
if n - k >= 1
)
N, K = [int(x) for x in input().split(" ")]
H = [None] + [int(x) for x in input().split(" ")]
print((solve(N)))
if __name__ == "__main__":
sys.setrecursionlimit(1024 * 1024 * 2)
threading.stack_size(128 * 1024 * 1024 * 2)
threading.Thread(target=main).start()
| p03161 |
from sys import stdin , stdout
def fun(a,k): ## k different steps can be taken
if len(a)==1:
return 0
dp = [float('inf')]*len(a)
dp[0]=0
dp[1]=dp[0]+abs(a[0]-a[1])
for i in range(2,len(a)):
t = 1
for j in range(1,k+1):
if i-j<0:
break
dp[i]=min(dp[i] , dp[i-j]+abs(a[i]-a[i-j]))
return dp[-1]
n,k = list(map(int , stdin.readline().split()))
a = list(map(int , stdin.readline().split()))
print((fun(a,k))) | def fun(a,k,n): ## k different steps can be taken
if n==1:
return 0
dp = [0]*n
dp[1]=dp[0]+abs(a[0]-a[1])
for i in range(2,len(a)):
t = 0
min_ = float('inf')
for j in range(i-1,-1,-1):
if t==k:
break
else:
t+=1
if dp[j]+abs(a[i]-a[j]) < min_ :
min_ = dp[j]+abs(a[i]-a[j])
dp[i]=min_
return dp[-1]
from sys import stdin , stdout
n,k = list(map(int , stdin.readline().split()))
a = list(map(int , stdin.readline().split()))
print((fun(a,k,n))) | p03161 |
from collections import deque
N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
def g(n, k, h):
gk = deque([0, abs(h[1] - h[0])], k)
g = abs(h[1] - h[0])
for i in range(2, n):
h_i = h[i]
j = max(i - k, 0)
g = min(abs(h_i - h_j) + h_k for h_j, h_k in zip(h[j:], gk))
if i >= k:
gk.popleft()
gk.append(g)
return g
print((g(N, K, h)))
| from collections import deque
N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
def g(n, k, h):
g = abs(h[1] - h[0])
gk = deque([0, g], k)
for i in range(2, n):
h_i = h[i]
j = max(i - k, 0)
g = min(abs(h_i - h_j) + h_k for h_j, h_k in zip(h[j:i], gk))
if i >= k:
gk.popleft()
gk.append(g)
return g
print((g(N, K, h)))
| p03161 |
N, K = list(map(int, input().split()))
hList = list(map(int, input().split()))
ans = 0
dp = [0] * N
dp[0] = 0
for i in range(1, N):
minT = 1000000000
for j in range(i - 1, i - K - 1, -1):
tmp = dp[j] + abs(hList[j] - hList[i])
minT = min(minT, tmp)
if j == 0:
break
dp[i] = minT
print((dp[N - 1])) | INF = 10 ** 9
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):
for j in range(K):
if i + j < N:
dp[i + j] = min(dp[i + j], dp[i - 1] + abs(h[i - 1] - h[i + j]))
print((dp[N - 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-1):
for j in range(1,k+1):
if i+j <= n-1:
dp[i+j] = min(dp[i] + abs(h[i] - h[i+j]), dp[i+j])
print((dp[n-1])) | def main():
import sys
input = sys.stdin.buffer.readline
N, K = (int(i) for i in input().split())
h = [0] + [int(i) for i in input().split()]
memo = [float('inf')] * (N+1)
memo[1] = 0
for j in range(2, N+1):
for i in range(j-K, j):
if i < 0:
continue
memo[j] = min(memo[j], memo[i] + abs(h[j] - h[i]))
print((memo[N]))
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.