input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
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 |
def main():
N,K = [int(e) for e in input().split()]
asiba = [int(e) for e in input().split()]
dp =[0] *N
#初期化
dp[0]=0
dp[1]=abs(asiba[1]-asiba[0])
for i in range(2,N):
dp[i] = min(dp[i-j]+abs(asiba[i]-asiba[i-j]) for j in range(1,min(i+1,K+1)))
print((dp[N-1]))
main() | def main():
N,K = [int(e) for e in input().split()]
asiba = [int(e) for e in input().split()]
dp =[0] *N
#初期化
dp[0]=0
dp[1]=abs(asiba[1]-asiba[0])
for i in range(2,N):
dp[i] = min(abs(asiba[i] - asiba[j]) + dp[j] for j in range(max(0, i - K), i))
print((dp[N-1]))
main()
| p03161 |
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):
index = i - K
if index < 0: index = 0
ans = 10**9
for j in range(index,i):
ans = min(ans,dp[j] + abs(h[i] - h[j]))
dp[i] = ans
print((dp[N-1]))
if __name__ == '__main__':
main() | def main():
N,K= list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [-1]*N
dp[0] = 0
dp[1] = abs(h[0] - h[1])
for i in range(2,N):
tmp = i - K
if tmp < 0: tmp = 0
cost_min = 10**9
for j in range(tmp,i):
ans = dp[j] + abs(h[i] - h[j])
if cost_min > ans: cost_min = ans
dp[i] = cost_min
print((dp[N-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(0, i-k), 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
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
for j in range(1,k+1):
if i-j>=0:
res=abs(h[i]-h[i-j])
dp[i]=min(dp[i],dp[i-j]+res)
else:
break
print((dp[n-1]))
| p03161 |
def calc_cost2(h, k):
n = len(h)
if (n == 0):
return 0
cost = n * [None]
cost[0] = 0
for i in range(1, len(h)):
#cost[i] = min([cost[s] + abs(h[i] - h[s]) for s in range(max(0, i-k), i)])
cost[i] = min([cost[s] + abs(h[i] - h[s]) for s in range(max(0, i-k), i)])
return cost[n-1]
if __name__ == "__main__":
n, k = list(map(int, input().split(" ")))
h = list(map(int, input().split(" ")))
res = calc_cost2(h, k)
print(res) | def calc_cost2(h, k):
n = len(h)
if (n == 0):
return 0
cost = n * [None]
cost[0] = 0
for i in range(1, len(h)):
cost[i] = min([cost[s] + abs(h[i] - h[s]) for s in range(max(0, i-k), i)])
#cost[i] = min(map(lambda s: cost[s] + abs(h[i] - h[s]), range(max(0, i-k), i)))
return cost[n-1]
if __name__ == "__main__":
n, k = list(map(int, input().split(" ")))
h = list(map(int, input().split(" ")))
res = calc_cost2(h, k)
print(res) | p03161 |
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
c = [0] + [abs(h[1] - h[0])]
for i in range(2, n):
min_step = 10 ** 4
for j in reversed(list(range(i))):
if i - j > k:
continue
step = abs(h[i] - h[j]) + c[j]
if step < min_step:
min_step = step
c.append(min_step)
print((c.pop()))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
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]))
if __name__ == "__main__":
main()
| p03161 |
N, K = list(map(int, input().split()))
h = [int(x) for x in input().split()]
INF = float('inf')
dp = [INF for _ in range(N+K+10)]
# initial state
dp[0] = 0
for i in range(N):
lim = min(len(h)-i, K+1)
for j in range(1, lim):
dp[i+j] = min(dp[i] + abs(h[j+i] - h[i]), dp[i+j])
print((dp[N-1])) | N, K = list(map(int, input().split()))
h = [int(x) for x in input().split()]
INF = float('inf')
dp = [INF for _ in range(N+K+10)]
# initial state
dp[0] = 0
for i in range(N):
for j in range(1, min(K+1, len(h)-i)):
dp[i+j] = min(dp[i] + abs(h[j+i] - h[i]), dp[i+j])
print((dp[N-1])) | p03161 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=["INF" for _ in range(n)]
dp[0]=0
#print(r)
for i in range(n):
for j in range(min(k,n-i-1)):
if dp[i+j+1]=="INF":
dp[i+j+1]=dp[i]+abs(a[i+j+1]-a[i])
else:
dp[i+j+1]=min(dp[i+j+1],dp[i]+abs(a[i+j+1]-a[i]))
#print(i,i+j,">>",r)
print((dp[-1]))
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[100000000000000000 for _ in range(n)]
dp[0]=0
#print(r)
for i in range(n):
for j in range(min(k,n-i-1)):
dp[i+j+1]=min(dp[i+j+1],dp[i]+abs(a[i+j+1]-a[i]))
#print(i,i+j,">>",r)
print((dp[-1]))
| p03161 |
from sys import stdin
def totalcost_recur(i,cost,N,lookup):
if i>=N:
return 0
if i in lookup:
return lookup[i]
option1 = abs(cost[i]-cost[i+1]) + totalcost_recur(i+1,cost,N,lookup)
ans = option1
if i+2<=N:
option2 = abs(cost[i]-cost[i+2]) + totalcost_recur(i+2,cost,N,lookup)
ans = min(option2,ans)
lookup[i] = ans
return ans
def totalcost_dp(cost,N,k):
dp = [float('inf')]*(N+1)
dp[1] = 0
for i in range(1,N+1):
for j in range(i+1,k+i+1):
if j < N+1:
dp[j] = min(dp[j],dp[i]+abs(cost[i]-cost[j]))
return dp[N]
n ,k= list(map(int,stdin.readline().split()))
cost = list(map(int,stdin.readline().split()))
cost = [0]+cost
print((totalcost_dp(cost,n,k))) |
def totalcost_dp(cost,N,k):
dp = [float('inf')]*(N+1)
dp[1] = 0
for i in range(1,N+1):
for j in range(i+1,k+i+1):
if j < N+1:
dp[j] = min(dp[j],dp[i]+abs(cost[i]-cost[j]))
return dp[N]
n ,k= list(map(int,input().split()))
cost = list(map(int,input().split()))
cost = [0]+cost
print((totalcost_dp(cost,n,k))) | p03161 |
# 貰うDP
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
INF=10**9
dp=[INF]*(N)
dp[0]=0
for n in range(1,N):
dp[n]=min([dp[k] + abs(h[n] - h[k]) for k in range(max(0,n-K), n)])
print((dp[N-1])) | # 配るDP
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
INF=10**9
add_list=[INF]*K
H.extend(add_list)
dp=[INF]*(N+100) #Kの分追加
dp[0]=0
for n in range(N):
for k in range(n+1,n+K+1):
dp[k]=min(dp[k], dp[n]+abs(H[n]-H[k]))
print((dp[N-1])) | p03161 |
# 貰うDP
N,K=list(map(int,input().split()))
h=[int(_) for _ in input().split()]
INF=10**9
dp=[INF]*(N)
dp[0]=0
for n in range(1,N):
dp[n]=min([dp[k] + abs(h[n] - h[k]) for k in range(max(0,n-K), n)])
print((dp[N-1])) | # 貰うDP
N,K=list(map(int,input().split()))
h=[int(_) for _ in input().split()]
INF=10**9
dp=[0]*(N)
for n in range(1,N):
dp[n]=min([dp[k] + abs(h[n] - h[k]) for k in range(max(0,n-K), n)])
print((dp[N-1])) | p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
INF = 10**10
dp = [INF]*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])) | import sys
read = lambda: sys.stdin.readline().rstrip()
def main():
INF = 10 ** 20
n,k = list(map(int,input().split()))
h = tuple(map(int,read().split()))
dp = [INF]*(n+1)
dp[0] = 0
for i in range(1, n):
for j in range(1, k + 1):
if i - j < 0:
pass
else:
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print((dp[n-1]))
if __name__ == "__main__":
main() | p03161 |
N, K = list(map(int, input().split(" ")))
H = list(map(int, input().split(" ")))
l = [0]*(N+10)
for i in range(1, N):
l[i] = min(l[j]+abs(H[i]-H[j]) for j in range(max(0, i-K), i))
print((l[N-1])) | N, K = list(map(int, input().split(" ")))
H = list(map(int, input().split(" ")))
costs = [0]*(N+10)
for i in range(1, N):
j = max(0, i-K)
costs[i] = min(cost+abs(H[i]-h) for cost, h in zip(costs[j:i], H[j:i]))
print((costs[N-1])) | p03161 |
import sys
sys.setrecursionlimit(10**6)
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [None] * N
def solve(n):
if dp[n] is not None:
return dp[n]
if n == 0:
dp[n] = 0
elif n == 1:
dp[n] = abs(h[0] - h[1])
else:
ans = 10**10
for i in range(1, K+1):
if n - i < 0:
break
if dp[n - i] is not None:
temp = dp[n - i]
else:
temp = solve(n - i)
ans = min(ans, temp + abs(h[n - i] - h[n]))
dp[n] = ans
return dp[n]
print((solve(N-1))) | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
# dp = [None] * N
dp = [10**9] * N
for i in range(N):
if i == 0:
dp[0] = 0
elif i == 1:
dp[1] = abs(h[0]-h[1])
else:
# ans = 10**10
for j in range(1, K+1):
if j > i:
break
# ans = min(ans, dp[i-j] + abs(h[i-j]-h[i]))
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]))
# dp[i] = ans
print((dp[N-1])) | p03161 |
import sys
sys.setrecursionlimit(10**6)
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [None] * N
def solve(idx):
if dp[idx] is not None:
return dp[idx]
if idx == N - 1:
dp[idx] = 0
elif idx == N - 2:
dp[idx] = abs(h[idx] - h[idx + 1])
else:
temp = 10**10
for k in range(1, K + 1):
if idx + k == N:
break
temp = min(temp, solve(idx + k) + abs(h[idx] - h[idx + k]))
dp[idx] = temp
return dp[idx]
print((solve(0)))
| import sys
sys.setrecursionlimit(10**6)
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [None] * N
def solve(idx):
if dp[idx] is not None:
return dp[idx]
if idx == N - 1:
dp[idx] = 0
elif idx == N - 2:
dp[idx] = abs(h[idx] - h[idx + 1])
else:
temp = 10**10
for k in range(1, K + 1):
if idx + k == N:
break
if dp[idx + k] is None:
temp = min(temp, solve(idx + k) + abs(h[idx] - h[idx + k]))
else:
temp = min(temp, dp[idx + k] + abs(h[idx] - h[idx + k]))
dp[idx] = temp
return dp[idx]
print((solve(0))) | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0]
INF = float('inf')
for i in range(1, n):
act = INF
for j in range(k):
if i-j > 0:
act = min(act, dp[-1-j]+abs(h[i]-h[i-j-1]))
if act == 0:
break
dp.append(act)
print((dp[-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0]
INF = float('inf')
for i in range(1, n):
act = INF
for j in range(k):
if i-j > 0:
act = min(act, dp[-1-j]+abs(h[i]-h[i-j-1]))
dp.append(act)
print((dp[-1])) | p03161 |
h,k=list(map(int,input().split()))
def bupdp(l,h,k):
dp=[0]*(h+1)
dp[0] = 0
for i in range(0,h):
if i>k:
mini = 999999999
for j in range(1,k+1):
mini = min(mini,dp[i-j]+abs(l[i]-l[i-j]))
dp[i] = mini
if i<=k:
minim = 999999999
for j in range(1,i+1):
minim = min(minim,dp[i-j]+abs(l[i]-l[i-j]))
dp[i] = minim
if i<1:
dp[i] = 0
return dp[-2]
l = list(map(int,input().split()))
print((bupdp(l,h,k))) | h,k=list(map(int,input().split()))
def bupdp(l,h,k):
dp=[0]*(h+1)
dp[0] = 0
for i in range(0,h):
if i>k:
mini = min([dp[i-j]+abs(l[i]-l[i-j]) for j in range(1,k+1)])
dp[i] = mini
if i<=k and i!=0:
minim = min([dp[i-j]+abs(l[i]-l[i-j]) for j in range(1,i+1)])
dp[i] = minim
if i<1:
dp[i] = 0
return dp[-2]
l = list(map(int,input().split()))
print((bupdp(l,h,k))) | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
INF = 10 ** 18
h = H + [0] * K
dp = [INF] * (N + K)
dp[0] = 0
for n in range(N):
for k in range(1, K + 1):
l, r = n, n + k
dp[r] = min(dp[r], dp[l] + abs(h[l] - h[r]))
print((dp[N - 1]))
| N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
INF = 10 ** 18
h = H
dp = [0] * N
for n in range(1, N):
l, r = max(0, n - K), n
dp[n] = min([dpl + abs(hl - h[r]) for dpl, hl in zip(dp[l:r], h[l:r])])
#print(dp)
print((dp[N - 1]))
| p03161 |
n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
dp = [float('inf')] * n
dp[0] = 0
for i in range(1, n):
for j in range(max(i - k, 0), i):
np = dp[j] + abs(h[i] - h[j])
if np < dp[i]:
dp[i] = np
print((dp[n - 1]))
| def main():
n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
dp = [float('inf')] * n
dp[0] = 0
for i in range(1, n):
for j in range(max(i - k, 0), i):
np = dp[j] + abs(h[i] - h[j])
if np < dp[i]:
dp[i] = np
print((dp[n - 1]))
main()
| p03161 |
n,k=[int(i) for i in input().split()]
h=[int(i) for i in input().split()]
#import numpy as np
#a=np.array(h)
b=[[0 for i in range(n)] for j in range(n)]
#b=np.array(b)
for j in range(n):
for i in range(n):
if j>i:
b[j][i]=abs(h[j]-h[i])
#print(b)
dp=[int(0) for i in range(n)]
dp0=[[10000000000 for i in range(n)] for j in range(n)]
dp0[0]=0
dp[0]=0
dp0[1]=b[1][0]
dp[1]=dp0[1]
if k==1:
for i in range(2,n):
dp[i]=dp[i-1]+b[i][i-1]
if k > 1:
for j in range(2,n):
if j <=k:
for i in range(j):
dp0[j][i]=dp[i]+b[j][i]
dp[j]=min(dp0[j])
else:
for i in range(k):
dp0[j][i+j-k]=dp[i+j-k]+b[j][i+j-k]
dp[j]=min(dp0[j])
#print(dp0)
print((dp[n-1])) | n,k=[int(i) for i in input().split()]
h=[int(i) for i in input().split()]
#print(n,k,h)
dp=[float('inf') for i in range(n)]
dp[0]=0
dp[1]=abs(h[1]-h[0])
if k > 1 and n > 2:
for y in range(2,k):
dp[y]=abs(h[y]-h[0])
x=1
while x < k:
tmp=dp[x]+abs(h[y]-h[x])
if tmp < dp[y]:
dp[y]=tmp
x+=1
for y in range(k,n):
dp[y]=dp[y-1]+abs(h[y]-h[y-1])
for x in range(2,k+1):
tmp=dp[y-x]+abs(h[y]-h[y-x])
if tmp < dp[y]:
dp[y]=tmp
if k == 1 and n > 2:
for y in range(2,n):
dp[y]=dp[y-1]+abs(h[y]-h[y-1])
print((dp[-1]))
| p03161 |
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(eval(input())) #整数読み込み
def ifn(): return float(eval(input())) #浮動小数点読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return list(map(int, input().split())) #整数map取得
def fmn(): return list(map(float, input().split())) #浮動小数点map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def add_mod(a,b): return (a+b) % MOD
N,K = imn()
h = iln()
dp = [10**10 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[i]-h[i+j]))
print((dp[N-1]))
| import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(eval(input())) #整数読み込み
def ifn(): return float(eval(input())) #浮動小数点読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return list(map(int, input().split())) #整数map取得
def fmn(): return list(map(float, input().split())) #浮動小数点map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
N,K = imn()
h = iln()
dp = [10**10 for _ in range(N)]
dp[0] = 0
for i in range(N):
for k in range(1,K+1):
if i+k < N: dp[i+k] = min(dp[i+k], dp[i]+abs(h[i+k]-h[i]))
print((dp[N-1])) | p03161 |
n, K = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 1 << 40
dp = [INF] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(1, n - 1):
minv = 1 << 40
for k in range(1, K + 1):
if i + 1 - k < 0:
continue
minv = min(minv, dp[i + 1 - k] + abs(h[i + 1] - h[i + 1 - k]))
dp[i + 1] = minv
print((dp[-1])) | n, k = list(map(int, input().split()))
h = [0] + list(map(int, input().split()))
INF = 1 << 30
dp = [INF] * (n + 1)
dp[0] = 0
dp[1] = 0
for i in range(2, n + 1):
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])) | p03161 |
def LI(): return list(map(int, input().split()))
inf = float('inf')
n, k = LI()
h = LI()
# init
dp = [inf] * k + [0] * n
d = [[inf] * j + [abs(h[i+j] - h[i]) for i in range(n-j)] for j in range(1, k+1)]
# calc
for i in range(1, n):
d_i = [dp[i-j+k] + d[j-1][i] for j in range(1, k+1)]
dp[i+k] = min(d_i)
print((dp[-1]))
"""
"""
| def LI(): return list(map(int, input().split()))
inf = float('inf')
n, k = LI()
h = LI()
# init
dp = [inf] * k + [0] * n
# calc
for i in range(1, n):
d_i = [(dp[i+k-(j+1)] + abs(h[i] - h[i-(j+1)]) if j < i else inf) for j in range(k)]
# print(i, d_i, dp)
dp[i+k] = min(d_i)
print((dp[-1]))
"""
"""
| p03161 |
def main():
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[10**5]*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]))
main()
| n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[10**10]*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 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,k = LI()
a = LI()
r = [0] * n
for i in range(1,n):
ai = a[i]
t = r[i-1] + abs(a[i-1]-ai)
j = i - 2
mj = i - k
if mj < 0:
mj = 0
while j >= mj:
u = r[j] + abs(a[j]-a[i])
if t > u:
t = u
j -= 1
r[i] = t
return r[-1]
print(main())
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,k = LI()
a = LI()
r = [0] * n
for i in range(1,n):
ai = a[i]
t = r[i-1] + abs(a[i-1]-ai)
mj = i - k
if mj < 0:
mj = 0
for j in range(mj,i-1):
u = r[j] + abs(a[j]-ai)
if t > u:
t = u
r[i] = t
return r[-1]
print(main())
| p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(N):
if i > 0:
dp[i] = min([dp[i - j] + abs(h[i] - h[i - j]) if i - j >= 0 else 10**9 for j in range(1, K + 1)])
print((dp[N - 1]))
| 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:
x = max(0, i - K)
dp[i] = min([dpj + abs(hi - hj) for hj, dpj in zip(h[x:i], dp[x:i])])
print((dp[N - 1]))
| p03161 |
#!/usr/bin/env python3
n, k = [int(i) for i in input().split(' ')]
k += 1
harr = [int(i) for i in input().split(' ')]
dp = [10**9]*n
dp[0] = 0
for i in range(1, n):
for j in range(1, k):
if i - j < 0:
break
dp[i] = min(dp[i], dp[i-j] + abs(harr[i]-harr[i-j]))
print((dp[n-1]))
| #!/usr/bin/env python3
n, k = [int(i) for i in input().split(' ')]
arr = [int(i) for i in input().split(' ')]
dp = [10**10]*n
k += 1
dp[0] = 0
for i in range(0, n):
for j in range(1, k):
if i+j < n:
dp[i+j] = min(dp[i+j], dp[i] + abs(arr[i+j]-arr[i]))
print((dp[n-1]))
| p03161 |
import sys
def solve():
N, K, *H = list(map(int, sys.stdin.read().split()))
dp = [10**10] * N
dp[0] = 0
for i, h in enumerate(H):
dp_i = dp[i]
for k, dp_i_k in enumerate(dp[i+1:i+K+1], start=1):
if i+k > N-1:
break
tmp_dp = dp_i + abs(h - H[i+k])
if dp_i_k > tmp_dp:
dp[i+k] = tmp_dp
return dp[-1]
if __name__ == "__main__":
answer = solve()
print(answer)
| import sys
def solve():
N, K, *H = list(map(int, sys.stdin.read().split()))
dp = [0] * N
for i in range(1, N):
s = i-K if i-K > 0 else 0
dp[i] = min(dp[j] + abs(H[i] - H[j]) for j in range(s, i))
return dp[-1]
if __name__ == "__main__":
answer = solve()
print(answer)
| p03161 |
import sys
def solve():
N, K, *H = list(map(int, sys.stdin.read().split()))
dp = [0] * N
for i in range(1, N):
s = i-K if i-K > 0 else 0
dp[i] = min(dp[j] + abs(H[i] - H[j]) for j in range(s, i))
return dp[-1]
if __name__ == "__main__":
answer = solve()
print(answer)
| import sys
def solve():
N, K, *H = list(map(int, sys.stdin.read().split()))
dp = [0] * N
for i in range(1, N):
h_i = H[i]
s = i-K if i-K > 0 else 0
dp[i] = min(d_j + abs(h_i - h_j) for d_j, h_j in zip(dp[s:i], H[s:i]))
return dp[-1]
if __name__ == "__main__":
answer = solve()
print(answer)
| p03161 |
def main():
import sys
input = sys.stdin.readline
n,k=list(map(int,input().split()))
h=tuple(map(int,input().split()))
dp=[0]*(n+1)
for i in range(2,n+1):
a=min(i-1,k)+1
dp[i]+=min([dp[i-j]+abs(h[i-1]-h[i-j-1]) for j in range(1,a)])
print((dp[-1]))
if __name__=='__main__':
main() | def main():
import sys
input = sys.stdin.readline
n,k=list(map(int,input().split()))
h=tuple(map(int,input().split()))
dp=[0]*(n+1)
for i in range(2,n+1):
a=min(i-1,k)+1
m=float('inf')
for j in range(1,a):
x=dp[i-j]+abs(h[i-1]-h[i-j-1])
m=x if m>=x else m
dp[i]+=m
print((dp[-1]))
if __name__=='__main__':
main() | p03161 |
# given an array of Heights, jump from 1 to N with at most K sized jump to N
# each jump incurs abs(H[j] - H[i]) cost
# minimize cost of jumps from 1 to N
#
import collections
def frog(H, k):
if k > len(H):
k = len(H)
K = collections.deque([0] * (k + 1))
n = len(H)
klen = len(K)
for i in range(n):
cost = 0
if i > 0:
maxjump = min(i, k)
cost = float("inf")
for j in range(1, maxjump + 1):
jcost = abs(H[i] - H[i - j]) + K[klen - j]
if jcost < cost:
cost = jcost
K.popleft()
K.append(cost)
return cost
assert frog([40, 10, 20, 70, 80, 10, 20, 70, 80, 60], 4) == 40
assert frog([10, 10], 100) == 0
assert frog([10, 20, 10], 1) == 20
if __name__ == "__main__":
import sys
s = sys.stdin.read()
N, k, *H = list(map(int, s.split()))
ans = frog(H, k)
print(ans)
| # given an array of Heights, jump from 1 to N with at most K sized jump to N
# each jump incurs abs(H[j] - H[i]) cost
# minimize cost of jumps from 1 to N
#
import collections
def frog(H, k):
if k > len(H):
k = len(H)
K = collections.deque([0] * (k + 1))
n = len(H)
klen = len(K)
inf = float("inf")
for i in range(n):
cost = 0
if i > 0:
maxjump = i if i < k else k # min(i, k)
cost = inf
hi = H[i]
for j in range(1, maxjump + 1):
jcost = abs(hi - H[i - j]) + K[klen - j]
if jcost < cost:
cost = jcost
K.popleft()
K.append(cost)
return cost
assert frog([40, 10, 20, 70, 80, 10, 20, 70, 80, 60], 4) == 40
assert frog([10, 10], 100) == 0
assert frog([10, 20, 10], 1) == 20
if __name__ == "__main__":
import sys
s = sys.stdin.read()
N, k, *H = list(map(int, s.split()))
ans = frog(H, k)
print(ans)
| p03161 |
# given an array of Heights, jump from 1 to N with at most K sized jump to N
# each jump incurs abs(H[j] - H[i]) cost
# minimize cost of jumps from 1 to N
#
import collections
def frog(H, k):
if k > len(H):
k = len(H)
K = collections.deque([0] * (k + 1))
n = len(H)
klen = len(K)
inf = float("inf")
for i in range(n):
cost = 0
if i > 0:
maxjump = i if i < k else k # min(i, k)
cost = inf
hi = H[i]
for j in range(1, maxjump + 1):
jcost = abs(hi - H[i - j]) + K[klen - j]
if jcost < cost:
cost = jcost
K.popleft()
K.append(cost)
return cost
assert frog([40, 10, 20, 70, 80, 10, 20, 70, 80, 60], 4) == 40
assert frog([10, 10], 100) == 0
assert frog([10, 20, 10], 1) == 20
if __name__ == "__main__":
import sys
s = sys.stdin.read()
N, k, *H = list(map(int, s.split()))
ans = frog(H, k)
print(ans)
| # given an array of Heights, jump from 1 to N with at most K sized jump to N
# each jump incurs abs(H[j] - H[i]) cost
# minimize cost of jumps from 1 to N
#
def frog(H, k):
if k > len(H):
k = len(H)
n = len(H)
K = [0] * n
inf = float("inf")
for i in range(n):
cost = 0
if i > 0:
maxjump = i if i < k else k # min(i, k)
cost = inf
hi = H[i]
# jump source going backwards from i-1 (smallest 1 sized jump) to i - maxjumps
for j in range(i - 1, i - maxjump - 1, -1):
jcost = abs(hi - H[j]) + K[j]
if jcost < cost:
cost = jcost
K[i] = cost
return cost
assert frog([40, 10, 20, 70, 80, 10, 20, 70, 80, 60], 4) == 40
assert frog([10, 10], 100) == 0
assert frog([10, 20, 10], 1) == 20
if __name__ == "__main__":
import sys
s = sys.stdin.read()
N, k, *H = list(map(int, s.split()))
ans = frog(H, k)
print(ans)
| p03161 |
import sys
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: list(map(int, sys.stdin.readline().split()))
nms = lambda: list(map(str, sys.stdin.readline().split()))
nl = lambda: list(nm())
n, k = nm()
h = nl()
h.insert(0, h[0])
INF = 10 ** 9
dp = [INF for _ in range(n + 1)]
dp[1] = 0
for i in range(2, n + 1):
x = max(i - k, 1)
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(x, i)])
print((dp[-1]))
| import sys
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: list(map(int, sys.stdin.readline().split()))
nms = lambda: list(map(str, sys.stdin.readline().split()))
nl = lambda: list(nm())
n, k = nm()
h = nl()
h.insert(0, h[0])
INF = 10 ** 9
dp = [INF for _ in range(n + 1)]
dp[1] = 0
for i in range(2, n + 1):
x = max(i - k, 1)
dp[i] = min([d + abs(h[i] - hd) for d, hd in zip(dp[x:i], h[x:i])])
print((dp[-1]))
| p03161 |
n,k,*h=list(map(int,open(0).read().split()));
dp=[0];
for i in range(1,n):dp+=[min(10**9*(i-j>k)+dp[j]+abs(h[j]-h[i])for j in range(i))];
print((dp[-1])) | n,k,*h=list(map(int,open(0).read().split()));
dp=[0];
for i in range(1,n):dp+=[min(dp[j]+abs(h[j]-h[i])for j in range(max(i-k,0),i))];
print((dp[-1])) | p03161 |
import sys
input=sys.stdin.readline
n,k=list(map(int,input().split()))
cst=list(map(int,input().split()))
arr=[0]*(n+1)
arr[0]=0
arr[1]=abs(cst[1]-cst[0])
if n==2:
print((arr[1]))
else:
for i in range(2, n):
#arr[i] = min(abs(cst[i - 1] - cst[i]) + arr[i - 1], abs(cst[i - 2] - cst[i]) + arr[i - 2])
#t=cst.index(min(cst[max(i-k,0):i]))
#arr[i]=min(abs(cst[max(i-j,0)]-cst[i])+arr[i-j] for j in range(1,k+1))
arr[i]=min(abs(cst[j]-cst[i])+arr[j] for j in range(max(i-k,0),i))
print((arr[n-1]))
#print(arr) | import sys
def input():
return sys.stdin.readline().strip()
def main():
n, k = list(map(int, input().split()))
cst = list(map(int, input().split()))
arr = [0] * n
arr[1] = abs(cst[1] - cst[0])
for i in range(2, n):
arr[i] = min(abs(cst[j] - cst[i]) + arr[j] for j in range(max(i - k, 0), i))
print((arr[n - 1]))
if __name__ == '__main__':
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 = [i for i in map(int, input().split())]
DP = [0]
for i in range(n-1):
act = float("inf")
for j in range(k):
if i < j: continue
act = min(abs(h[i+1]-h[i-j])+DP[-1-j], act)
DP += [act]
print((DP[-1])) | p03161 |
def main():
n, k = list(map(int, input().split()))
heights = list(map(int, input().split()))
dp = [float('inf') for i in range(n)]
dp[0] = 0
for i in range(0, n):
for j in range(1, k + 1):
if i + j == len(heights):
break
dp[i + j] = min(dp[i + j], dp[i] + abs(heights[i] - heights[i + j]))
print((dp[n - 1]))
if __name__ == '__main__':
main()
| def main():
n, k = list(map(int, input().split()))
heights = list(map(int, input().split()))
dp = [float('inf') for i in range(n)]
dp[0] = 0
for i in range(1, n):
dp[i] = min(dp[j] + abs(heights[i] - heights[j]) for j in range(max(i - k, 0), i))
# for j in range(1, k + 1):
# if i - j < 0:
# break
# dp[i] = min(dp[i], dp[i - j] + abs(heights[i] - heights[i - j]))
print((dp[n - 1]))
if __name__ == '__main__':
main()
| p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H = [H[0]]*K+H
def solve(H):
dp = [0]*(N+K)
for i in range(K,N+K):
dp[i]= 10**10
for j in range(1,K+1):
dp[i] = min(dp[i],dp[i-j]+abs(H[i]-H[i-j]))
ans = dp[-1]
return ans
print((solve(H))) | 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(N):
for k in range(1,K+1):
if i+k<N:
dp[i+k] = min(dp[i+k],dp[i]+abs(H[i+k]-H[i]))
ans = dp[N-1]
return ans
print((solve())) | p03161 |
import sys
input = sys.stdin.readline
def frog_2():
N, K = map(int,input().split())
h = tuple(map(int,input().split()))
dp = [float("inf")] * (N)
dp[0] = 0
for n in range(1, N):
k = max(0, n - K)
dp[n] = min(abs(h[n] - h[i]) + dp[i] for i in range(k, n))
return print(dp[-1])
frog_2()
| import sys
input = sys.stdin.readline
def frog_2():
N, K = list(map(int,input().split()))
H = tuple(map(int,input().split()))
dp = [float("inf")] * N
dp[0] = 0
for n in range(1, N):
k = max(0, n - K) # k: 'n' ループ目の最大ジャンプ幅 'K'
h = H[n] # h: 'n' ループ目の足場の高さ'H'
dp[n] = min(abs(h - H[i]) + dp[i] for i in range(k, n))
print((dp[-1]))
frog_2() | 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)
#print(dp)
for i in range(1,n):
K = max(0, i - k) # K: 'i' ループ目の最大ジャンプ幅 'k'
H = h[i] # H: 'i' ループ目の足場の高さ'h'
for j in range(K, i):
dp[i] = min(dp[i], dp[j]+abs(H - h[j]))
#print(dp)
print((dp[-1]))
| # AC by Pypy3, not Python3
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)
#print(dp)
for i in range(1,n):
K = max(0, i - k) # K: 'i' ループ目の最大ジャンプ幅 'k'
H = h[i] # H: 'i' ループ目の足場の高さ'h'
for j in range(K, i):
dp[i] = min(dp[i], dp[j]+abs(H - h[j]))
#print(dp)
print((dp[-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):
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()))
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]))
| p03161 |
import sys
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
INF = sys.maxsize
DP = [INF] * N
for i in range(N):
for k in range(1, K+1):
if DP[i] < INF:
DP[i] = min(abs(H[i] - H[max(i - k, 0)]) + DP[max(i - k, 0)], DP[i])
else:
DP[i] = abs(H[i] - H[max(i - k, 0)]) + (DP[max(i - k, 0)] if DP[max(i - k, 0)] != INF else 0)
print((DP[N-1]))
| import sys
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
INF = sys.maxsize
DP = [INF] * N
for i in range(N):
for k in range(1, K+1):
DP[i] = min(abs(H[i] - H[max(i - k, 0)]) + (DP[max(i - k, 0)] if DP[max(i - k, 0)] != INF else 0), DP[i])
print((DP[N-1]))
| p03161 |
def main():
N,K=list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [float('inf')] * N
dp[0] = 0
for i in range(1,len(A)):
jmp = max(0,i-K)
dp[i] = min([dp[j]+abs(A[i]-A[j]) for j in range(jmp, i)])
print((dp[N-1]))
main() | N,K=list(map(int, input().split()))
A = list(map(int, input().split()))
INF = 10**9
dp = [INF]*N
for i in range(len(A)):
if i == 0:
dp[0] = 0
elif i == 1:
dp[1] = abs(A[1]-A[0])
else:
jmp = min(i,K)
for j in range(1,jmp+1):
dp[i] = min(dp[i], dp[i-j]+abs(A[i]-A[i-j]))
print((dp[N-1])) | p03161 |
N,K = list(map(int,input().split()))
H = [int(x) for x in 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])) | # -*- coding: utf-8 -*-
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 = list(map(int, input().split()))
dp = [-1] * n
dp[0] = 0
for i in range(1, min(n, k)):
dp[i] = min([dp[j] + abs(h[i]-h[j]) for j in range(i)])
for i in range(k, n):
dp[i] = min([dp[i-j] + abs(h[i]-h[i-j]) for j in range(1, k+1)])
print((dp[n-1])) | import sys
data = sys.stdin.readlines()
n, k = list(map(int, data[0].split()))
h = list(map(int, data[1].split()))
dp = [-1] * n
dp[0] = 0
for i in range(1, min(n, k)):
dp[i] = min([dp[j] + abs(h[i]-h[j]) for j in range(i)])
for i in range(k, n):
dp[i] = min([dp[i-j] + abs(h[i]-h[i-j]) for j in range(1, k+1)])
print((dp[n-1])) | p03161 |
import sys
def input():
return sys.stdin.readline()[:-1]
N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
inf = 10**9+7
dp = [inf] * (N+10)
dp[0] = 0
for i,h in enumerate(H):
for j in range(1,K+1):
if i+j < N:
dp[i+j] = min(dp[i+j],dp[i] + abs(h-H[i+j]))
print((dp[N-1]))
|
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
INF = 10**20
dp = [INF]*(N+10)
dp[0] = 0
def distance(x,y):
return abs(h[x]-h[y])
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] + distance(i-k,i))
print((dp[N-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):
cost = []
for j in range(1,min(K,i)+1):
cost.append(dp[i-j] + abs(h[i]-h[i-j]))
dp[i] = min(cost)
print((dp[-1])) | N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
inf = float("inf")
dp = [0]*N
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2,N):
cost = []
for j in range(1,min(K,i)+1):
cost.append(dp[i-j] + abs(h[i]-h[i-j]))
dp[i] = min(cost)
print((dp[-1])) | p03161 |
num,jump=list(map(int,input().split()))
height=list(map(int,input().split()))
dp=[10**9]*(num)
dp[0]=0
# dp[1]=abs(height[1]-height[0])
# for i in range(2,num):
# dp[i]=min(dp[i-1]+abs(height[i]-height[i-1]),dp[i-2]+abs(height[i]-height[i-2]))
for i in range(1,num):
for j in range(1,min(i,jump)+1):
dp[i]=min(dp[i],dp[i-j]+abs(height[i]-height[i-j]))
print((dp[-1])) | num,jump=list(map(int,input().split()))
height=list(map(int,input().split()))
dp=[10**9]*(num)
dp[0]=0
for i in range(1,num):
for j in range(1,min(i,jump)+1):
dp[i]=min(dp[i],dp[i-j]+abs(height[i]-height[i-j]))
print((dp[-1]))
| p03161 |
N,k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
DP = [1000000000]*N
DP[0] = 0
def handan(i,x):
if DP[i] > x:
DP[i] = x
for i in range(1,N):
for j in range(min(i,k)):
x = DP[i-j-1] + abs(h[i]-h[i-j-1])
handan(i,x)
print((DP[N-1])) | N,K = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
DP=[100000000000]*(N+1)
DP[0] = 0
DP[1] = 0
DP[2] = DP[1] + abs(h[0]-h[1])
for i in range(1,N):
for j in range(i+1,min(i+K+1,N+1)):
DP[j] = min(DP[j],DP[i]+abs(h[j-1]-h[i-1]))
print((DP[N])) | p03161 |
N,K = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
DP=[1000000000]*(N+1)
DP[0] = 0
DP[1] = 0
DP[2] = DP[1] + abs(h[0]-h[1])
for i in range(1,N):
for j in range(i+1,min(i+K+1,N+1)):
DP[j] = min(DP[j],DP[i]+abs(h[j-1]-h[i-1]))
print((DP[N])) | N,K = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
DP = [10**10]*N
DP[0] = 0
DP[1] = abs(h[0] - h[1])
for i in range(2,N):
for j in range(1,min(K+1,i+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()))
HHH = list(map(int, input().split()))
dp = [1000000000] * (N+K+2)
HHH.extend([0]*(K+2))
dp[0] = 0
"配るdpでやる？"
for i in range(0, N):
for j in range(1, K+1): # 1段~K段飛ぶ
dp[i+j] = min(dp[i+j], dp[i]+abs(HHH[i+j]-HHH[i]))
print((dp[N-1]))
| n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
def frog(n, k, h):
d = [float('inf')] * n
d[0] = 0
for i in range(1, n):
d[i] = min(
d[j] + abs(h[i] - h[j]) for j in range(max(i - k, 0), i)
)
return d[n - 1]
print((frog(n, k, h)))
| p03161 |
import heapq
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*N
for i in range(N):
he=[]
if i == 0:
dp[i] = 0
else:
for j in range(K):
heapq.heappush(he, dp[i-(j+1)]+abs(h[i]-h[i-(j+1)]) if i-(j+1) >= 0 else float('inf'))
dp[i] = heapq.heappop(he)
print((dp[N-1]))
| import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))+[INF]*K
dp=[INF]*(2*10**5)
dp[0]=0
for i in range(N):
for k in range(1,K+1):
dp[i+k]=min(dp[i+k],dp[i]+abs(h[i+k]-h[i]))
print((dp[N-1]))
if __name__ == '__main__':
main()
| p03161 |
import sys
from functools import lru_cache
sys.setrecursionlimit(20000000)
N, K = list(map(int, input().split()))
heights = [int(h) for h in input().split()]
@lru_cache(None)
def dfs(i):
if i == len(heights) - 1:
return 0
res = float("inf")
for k in range(1, K + 1):
if i + k < len(heights):
res = min(res, abs(heights[i] - heights[i + k]) + dfs(i + k))
return res
def helper():
dp = [float("inf")] * len(heights)
dp[0] = 0
for i in range(1, len(heights)):
dp[i] = min(dp[i],
min(dp[j] + abs(heights[j] - heights[i]) for j in range(max(i - K, 0), i))
)
return dp[-1]
# print(dfs(0))
print((helper())) | n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
def frog(n, k, h):
d = [float('inf')] * n
d[0] = 0
for i in range(1, n):
d[i] = min(
d[j] + abs(h[i] - h[j]) for j in range(max(i - k, 0), i)
)
return d[n - 1]
print((frog(n, k, h))) | p03161 |
def main():
# n, k = map(int, input().split())
# stns = [int(x) for x in input().split()]
n,k = list(map(int,input().split()))
stns = list(map(int, input().split()))
INF = 10**10
dp = [INF] * n
dp[0] = 0
for i in range(n):
for j in range(1, k + 1): # consider more than one step
j = i + j # step i + 1, i + 2
if j < n:
# min(existing min, new path using i)
dp[j] = min(dp[j], dp[i] + abs(stns[i] - stns[j]))
print((dp[n-1]))
main
if __name__ == "__main__":
main() | def main():
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [float('inf') for i in range(n)]
dp[0] = 0
for i in range(1,n):
for j in range(1,min(i+1,k+1)):
m = dp[i-j] + abs(h[i]-h[i-j])
if dp[i]>m:
dp[i] = m
print((dp[n-1]))
if __name__ == "__main__":
main() | p03161 |
import sys
def main():
input=sys.stdin.readline
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
if N-1<=K:
print((H[N-1]-H[0]))
return
inf=10**9+7
dp=[inf]*N
dp[0]=0
for i,h in enumerate(H):
if i==0:continue
m=inf
M=max(0,i-K)
for ht,dpt in zip(H[M:i],dp[M:i]):
m=min(m, dpt+abs(h-ht))
dp[i]=m
print((dp[N-1]))
return
if __name__=="__main__":
main() | import sys
def main():
input=sys.stdin.readline
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
if N-1<=K:
print((H[N-1]-H[0]))
return
inf=10**9+7
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]))
return
if __name__=="__main__":
main() | p03161 |
#b
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
N=100010
INF=float('INF')
dp=[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])) | n,K=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
dp[i]=10**10
for k in range(1,min(K,i)+1):
dp[i]=min(dp[i],dp[i-k]+abs(h[i]-h[i-k]))
print((dp[n-1])) | p03161 |
N, K = list(map(int, input().split()))
h_list = list(map(int, input().split()))
dp = [float('INF') for i in range(N)]
dp[0] = 0
def change_min(a, b):
if a > b: return b
else: return a
for i in range(N):
for j in range(1, K + 1):
if i + j > N - 1: continue
dp[i + j] = change_min(dp[i] + abs(h_list[i] - h_list[i + j]), dp[i + j])
print((dp[N - 1])) | N, K = list(map(int, input().split()))
h_list = list(map(int, input().split()))
dp = [float('INF') for i in range(N)]
dp[0] = 0
def update_dp(now, next):
global h_list
global dp
global N
if next > N - 1: return
if dp[next] > dp[now] + abs(h_list[next] - h_list[now]):
dp[next] = dp[now] + abs(h_list[next] - h_list[now])
return
for i in range(N):
for j in range(1, K + 1):
update_dp(i, i + j)
print((dp[N - 1])) | p03161 |
if __name__=='__main__':
n,k,*h=list(map(int,open(0).read().split()))
dp=[0]*n
for i in range(1,n):
t=h[i]
d=10**18
for v,w in zip(dp[max(0,i-k):i],h[max(0,i-k):i]):
d=min(d,v+abs(t-w))
dp[i]=d
print((dp[-1])) | if __name__=='__main__':
n,k,*h=list(map(int,open(0).read().split()))
dp=[0]
for i,t in enumerate(h):
if i:
j=max(0,i-k)
dp.append(min(v+abs(t-w)for v,w in zip(dp[j:i],h[j:i])))
print((dp[-1])) | p03161 |
number = list(map(int,input().split()))
line = list(map(int,input().split()))
num = number[0]
K = number[1]
dp = [float("inf")]* num
dp[0] = 0
for i in range(1, num):
I = min(i + 1 , K + 1)
dp[i] = min([dp[i - k] + abs(line[i] - line[i - k]) for k in range(1 , I)])
#kの範囲: k = 1,2,3...K 無理なときは k = 1,2..i
print((dp[-1])) | def ans():
n, k, *h = list(map(int, open(0).read().split()))
dp = [float("inf")] * n
dp[0] = 0
for i in range(1, n):
min_j = max(0, i-k)
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(min_j , i)])
print((dp[n-1]))
ans() | p03161 |
num, K, *line = list(map(int, open(0).read().split()))
def main():
dp = [float("inf")]* num
dp[0] = 0
for i in range(1, num):
min_j = max(0, i - K)
dp[i] = min([dp[j] + abs(line[i] - line[j]) for j in range(min_j , i)])
#kの範囲: k = 1,2,3...K 無理なときは k = 1,2..i
print((dp[-1]))
main() | def main():
num, K, *line = list(map(int, open(0).read().split()))
dp = [float("inf")]* num
dp[0] = 0
for i in range(1, num):
min_j = max(0, i - K)
dp[i] = min([dp[j] + abs(line[i] - line[j]) for j in range(min_j , i)])
#kの範囲: k = 1,2,3...K 無理なときは k = 1,2..i
print((dp[-1]))
main()
| p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
def chmin(a, b):
if a > b:
return b
else:
return a
dp = [float('inf')] * n
dp[0] = 0
for i in range(1, n):
for j in range(1, min(k+1, i+1)):
dp[i] = chmin(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()))
dp = [float('inf')] * (n + 10)
dp[0] = 0
def chmin (a, b):
if a < b:
return a
else:
return b
for i in range(n):
if i == 0:
continue
if i < k:
for j in range(i):
dp[i] = chmin(dp[i], dp[i - j - 1] + abs(h[i] - h[i - j - 1]))
if k <= i < n:
for j in range(k):
dp[i] = chmin(dp[i], dp[i - j - 1] + abs(h[i] - h[i - j - 1]))
print((dp[n - 1])) | p03161 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,K=list(map(int,input().split()))
H=[int(x) for x in input().split()]
answer=[0,abs(H[1]-H[0])]+[0]*(N-2)
for i in range(2,N):
a=float('inf')
answer[i]=min(answer[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i))
print((answer[-1])) | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
def main():
N,K=list(map(int,input().split()))
H=[int(x) for x in input().split()]
answer=[0,abs(H[1]-H[0])]+[0]*(N-2)
for i in range(2,N):
a=float('inf')
answer[i]=min(answer[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i))
print((answer[-1]))
main() | p03161 |
# atcoder Educational DP contest/DP まとめコンテスト
# B-Frog2
def get_inputs():
[n, k] = [int(x) for x in input().split()]
h = list(map(int, input().split()))
return n, k, h
if __name__ == "__main__":
# 入力を受け取る
# n 足場の数 2<= N <= 10**5
# k k本先の足場まで飛ぶことができる 1<=K<=100
# h 足場の高さ 配列
n, k, h = get_inputs()
# for文の二重ループではTLEになってしまう
# dp = [10000000000] * (n + k) # k個分を含む配列を用意し最大値で初期化する
# h= h + [100000] * k
# dp[0] = 0 # 0番目の足場はコスト0
# 足場iからj個先まで行く場合の最小コストを求める
# for i in range(0, n - 1):
# for j in range(1, k + 1):
# dp[i + j] = min(dp[i] + abs(h[i + j] - h[i]), dp[i + j])
# print(dp[n-1])
dp = [10**9] * n
dp[0] = 0
for i in range(1, n):
mc = 10**9
for j in range(max(0, i - k), i):
mc = min(mc, dp[j] + abs(h[i] - h[j]))
dp[i] = mc
print((dp[n-1]))
| # atcoder Educational DP contest/DP まとめコンテスト
# B-Frog2
def get_inputs():
[n, k] = [int(x) for x in input().split()]
h = list(map(int, input().split()))
return n, k, h
if __name__ == "__main__":
# 入力を受け取る
# n 足場の数 2<= N <= 10**5
# k k本先の足場まで飛ぶことができる 1<=K<=100
# h 足場の高さ 配列
n, k, h = get_inputs()
########## first try
# for文の二重ループではTLEになってしまう
# dp = [10000000000] * (n + k) # k個分を含む配列を用意し最大値で初期化する
# h= h + [100000] * k
# dp[0] = 0 # 0番目の足場はコスト0
# 足場iからj個先まで行く場合の最小コストを求める
# for i in range(0, n - 1):
# for j in range(1, k + 1):
# dp[i + j] = min(dp[i] + abs(h[i + j] - h[i]), dp[i + j])
# print(dp[n-1])
########## second try
# 前案より速度は改善したが、まだ一部の問題でTLEになる
# dp = [10**9] * n
# dp[0] = 0
#
# for i in range(1, n):
# mc = 10**9
# for j in range(max(0, i - k), i):
# mc = min(mc, dp[j] + abs(h[i] - h[j]))
# dp[i] = mc
# print(dp[n-1])
########## third try
# 二重ループを内包表記表現に変更
# zipを使うのがミソ
dp = [10**9] * n
dp[0] = 0
for i in range(1, n):
j = max(0, i - k)
dp[i] = min([dd + abs(h[i] - hh) for (dd, hh) in zip(dp[j:i], h[j:i])])
print((dp[n-1]))
| p03161 |
n,k = list(map(int,input().split()))
arr = [int(i) for i in input().split()]
dp = [0 for j in range(n)]
for i in range(1,n):
dp[i] = float("inf")
for j in range(i-1,-1,-1):
if i-j <= k:
val = (abs(arr[i]-arr[j]) + dp[j])
dp[i] = min(dp[i],val)
print((dp[n-1]))
| n,k = list(map(int,input().split()))
arr = [int(i) for i in 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],abs(arr[i]-arr[j]) + dp[i])
print((dp[n-1])) | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
INF = 10**10
#dp = [[INF]*K]*N
dp = [[INF] * (K+1) for i in range(N)]
for i in range(N):
#j_max = min(K+1, k)
#print(dp)
H_i = H[i]
for j in range(1, K+1):
if i==0:
dp[i][j] = 0
elif j>i:
dp[i][j] = dp[i][j-1]
else:
#print(i,j)
#print(dp[i-j][K]+abs(H[i]-H[i-j]), dp[i][j-1])
dp[i][j] = min(dp[i-j][K]+abs(H_i-H[i-j]), dp[i][j-1])
#print(dp[i][j])
print((dp[N-1][K])) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
INF = 10**9
dp = [INF]*N
dp[0] = 0
for i in range(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])) | p03161 |
# coding:utf-8
import sys
input = sys.stdin.readline
INF = float('inf')
MOD = 10 ** 9 + 7
def inpl(): return list(map(int, input().split()))
n, k = inpl()
H = inpl()
if k >= n: k = n - 1
H = [H[0]] + H
dp = [INF] * (n + 1)
dp[0] = 0
for i in range(1, n + 1):
for j in range(1, k + 1):
if i - j < 0: break
dp[i] = min(dp[i], abs(H[i] - H[i - j]) + dp[i - j])
# print(dp)
print((dp[n]))
| # coding:utf-8
import sys
input = sys.stdin.readline
INF = float('inf')
MOD = 10 ** 9 + 7
def inpl(): return list(map(int, input().split()))
n, k = inpl()
H = inpl()
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], abs(H[i + j] - H[i]) + dp[i])
print((dp[n - 1]))
| p03161 |
def solve():
h, k = read()
result = think(h, k)
write(result)
def read():
n, k = read_int(2)
return read_int(n), k
def read_int(n):
return list([int(x) for x in read_line().split(' ')])[:n]
def read_line(n=0):
if n == 0:
return input().rstrip()
else:
return input().rstrip()[:n]
def think(h, k):
cache = preprocess(h, k)
cost = [0 for x in range(len(h))]
# element of h <= 10 ** 4, elements <= 10 ** 5, +1 in case
initial_value_of_cost = 10 ** (4 + 5) + 1
for dst in range(1, len(h)):
minimum_cost = initial_value_of_cost
for src in range(max(0, dst - k), dst):
minimum_cost = min(minimum_cost, cost[src] + cache[src][dst])
cost[dst] = minimum_cost
return cost[len(h) - 1]
def preprocess(h, k):
cache = [[0 for x in range(len(h))] for y in range(len(h))]
for src in range(len(h) - 1):
for dst in range(src + 1, min(len(h), src + k + 1)):
cost = abs(h[src] - h[dst])
cache[src][dst] = cost
return cache
def write(result):
print(result)
if __name__ == '__main__':
solve() | def solve():
h, k = read()
result = think(h, k)
write(result)
def read():
n, k = read_int(2)
return read_int(n), k
def read_int(n):
return list([int(x) for x in read_line().split(' ')])[:n]
def read_line(n=0):
if n == 0:
return input().rstrip()
else:
return input().rstrip()[:n]
def think(h, k):
cost = [0 for x in range(len(h))]
# element of h <= 10 ** 4, elements <= 10 ** 5, +1 in case
initial_value_of_cost = 10 ** (4 + 5) + 1
for dst in range(1, len(h)):
minimum_cost = initial_value_of_cost
for src in range(max(0, dst - k), dst):
minimum_cost = min(minimum_cost, cost[src] + abs(h[src] - h[dst]))
cost[dst] = minimum_cost
return cost[len(h) - 1]
def write(result):
print(result)
if __name__ == '__main__':
solve() | p03161 |
def solve():
h, k = read()
result = think(h, k)
write(result)
def read():
n, k = read_int(2)
return read_int(n), k
def read_int(n):
return list([int(x) for x in read_line().split(' ')])[:n]
def read_line(n=0):
if n == 0:
return input().rstrip()
else:
return input().rstrip()[:n]
def think(h, k):
cost = [0 for x in range(len(h))]
# element of h <= 10 ** 4, elements <= 10 ** 5, +1 in case
initial_value_of_cost = 10 ** (4 + 5) + 1
n = len(h)
for dst in range(1, n):
minimum_cost = initial_value_of_cost
start_point = max(0, dst - k)
for src in range(start_point, dst):
minimum_cost = min(minimum_cost, cost[src] + abs(h[src] - h[dst]))
cost[dst] = minimum_cost
return cost[n - 1]
def write(result):
print(result)
if __name__ == '__main__':
solve() | def solve():
h, k = read()
result = think(h, k)
write(result)
def read():
n, k = read_int(2)
return read_int(n), k
def read_int(n):
return list([int(x) for x in read_line().split(' ')])[:n]
def read_line(n=0):
if n == 0:
return input().rstrip()
else:
return input().rstrip()[:n]
def think(h, k):
cost = [0 for x in range(len(h))]
for dst in range(1, len(h)):
start_point = max(0, dst - k)
cost[dst] = min([cost[src] + abs(h[src] - h[dst]) for src in range(start_point, dst)])
return cost[len(h) - 1]
def write(result):
print(result)
if __name__ == '__main__':
solve() | p03161 |
n, k = list(map(int, input().split()))
*h, = list(map(int, input().split()))
dp = [float("inf")]*(n+1)
dp[0] = 0
for i in range(1, n):
if i < k:
dp[i] = min([dpj+abs(hj-h[i]) for dpj, hj in zip(dp[:i], h[:i])])
else:
dp[i] = min([dpj+abs(hj-h[i]) for dpj, hj in zip(dp[i-k:i], h[i-k: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):
if i == 1:
dp[1] = dp[0] + abs(h[0]-h[1])
continue
dp[i] = min([dp[i-j] + abs(h[i-j]-h[i]) for j in range(1, k+1)])
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(1, n):
if i < k:
dp[i] = min( { dp[j]+abs(h[j]-h[i]) for j in range(i) } )
else:
dp[i] = min( { dp[i-j-1]+abs(h[i-j-1]-h[i]) for j in range(k) } )
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):
if i < k:
dp[i] = min([ dp[j]+abs(h[j]-h[i]) for j in range(i) ])
else:
dp[i] = min( [ dp[i-j-1]+abs(h[i-j-1]-h[i]) for j in range(k) ] )
print((dp[n-1])) | p03161 |
import sys
def main():
n, k, *h = list(map(int, sys.stdin.read().split()))
dp = [float("inf")] * n
dp[0] = 0
for i in range(1, n):
if i < k:
dp[i] = min([ dp[j]+abs(h[j]-h[i]) for j in range(i) ])
else:
dp[i] = min( [ dp[i-j-1]+abs(h[i-j-1]-h[i]) for j in range(k) ] )
print((dp[n-1]))
if __name__ == "__main__":
main() | import sys
def main():
n, k, *h = list(map(int, sys.stdin.read().split()))
dp = [float("inf")] * n
dp[0] = 0
for i in range(1, n):
if i < k:
dp[i] = min([ dpj+abs(hj-h[i]) for dpj, hj in zip(dp[:i], h[:i]) ])
else:
dp[i] = min( [ dpj+abs(hj-h[i]) for dpj, hj in zip(dp[i-k:i], h[i-k:i]) ] )
print((dp[n-1]))
if __name__ == "__main__":
main() | p03161 |
#!/usr/bin/env python3
#import
#import math
#import numpy as np
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 >= N:
break
dp[i + j] = min(dp[i + j], dp[i] + abs(H[i + j] - H[i]))
print((dp[-1]))
| #!/usr/bin/env python3
#import
#import math
#import numpy as np
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):
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[-1]))
| p03161 |
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):
for j in range(K):
if i-j-1 < 0: break
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 = [10**18]*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[-1])) | p03161 |
def main():
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 k in range(1,K+1):
if i + k <= N - 1:
dp[i+k] = min(dp[i+k], dp[i] + abs(H[i+k] - H[i]))
else:
break
print((dp[N-1]))
if __name__ == "__main__":
main() | def main():
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [float('inf')] * (N + 5)
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] - H[i-k]))
print((dp[N-1]))
if __name__ == "__main__":
main() | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = float("inf")
dp = [inf] * N
dp[0] = 0
def chmin(table: list, num: int, sbn: int):
table[num + sbn] = min((table[num + sbn], table[num] + abs(h[i + sbn] - h[num])))
for i in range(N):
for sbn in range(K):
try:
chmin(dp, i, sbn + 1)
except IndexError:
break
print((dp[-1]))
| N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10**9
dp = [inf] * N
dp[0] = 0
def chmin(num: int, sbn: int):
dp[num + sbn] = min((dp[num + sbn], dp[num] + abs(h[i + sbn] - h[num])))
for i in range(N):
for sbn in range(K):
try:
chmin(i, sbn + 1)
except IndexError:
break
print((dp[-1]))
| p03161 |
N, K = list(map(int, input().split()))
hlist = list(map(int, input().split()))
inf = float("inf")
dp = [inf] * N
def abs_sbn(a, b):
return abs(hlist[b] - hlist[a])
dp[0] = 0
dp[1] = abs_sbn(0, 1)
for i in range(2, N):
for j in range(1, K + 1):
if (i - j) >= 0:
dp[i] = min(dp[i], dp[i - j] + abs_sbn(i, i - j))
print((dp[-1]))
| N, K = list(map(int, input().split()))
hlist = list(map(int, input().split())) + [0] * (K + 2)
inf = float("inf")
dp = [inf] * (N * K + 2)
def abs_sbn(a, b):
return abs(hlist[b] - hlist[a])
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_sbn(i, i + j))
print((dp[N - 1]))
| p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
INF = 10**10
dp = [INF]*N
dp[0] = 0
for i in range(N):
for k in range(1,K+1):
if i-k>=0:
dp[i] = min(dp[i],dp[i-k]+abs(h[i]-h[i-k]))
print((dp[-1])) | N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
INF = 10**10
dp = [INF]*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])) | p03161 |
# -*- coding: utf-8 -*-
"""
B - Frog 2
https://atcoder.jp/contests/dp/tasks/dp_b
"""
import sys
from sys import stdin
def solve(ashiba, N, K):
dp = [float('inf')] * N
dp[0] = 0
for i in range(1, len(ashiba)):
for j in range(max(0, i-K), i):
dp[i] = min(dp[i], dp[j]+abs(ashiba[j]-ashiba[i]))
return dp[-1]
def main(args):
N, K = list(map(int, input().split()))
ashiba = [int(i) for i in input().split()]
ans = solve(ashiba, N, K)
print(ans)
if __name__ == '__main__':
main(sys.argv[1:])
| # -*- coding: utf-8 -*-
"""
B - Frog 2
https://atcoder.jp/contests/dp/tasks/dp_b
"""
import sys
from sys import stdin
def solve(ashiba, N, K):
dp = [float('inf')] * N
dp[0] = 0
for i in range(1, len(ashiba)):
paths = [dp[j]+abs(ashiba[j]-ashiba[i]) for j in range(max(0, i-K), i)]
dp[i] = min(paths)
return dp[-1]
def main(args):
N, K = list(map(int, input().split()))
ashiba = [int(i) for i in input().split()]
ans = solve(ashiba, N, K)
print(ans)
if __name__ == '__main__':
main(sys.argv[1:])
| p03161 |
# -*- coding: utf-8 -*-
"""
B - Frog 2
https://atcoder.jp/contests/dp/tasks/dp_b
AC
"""
import sys
from sys import stdin
def solve(ashiba, N, K):
dp = [float('inf')] * N
dp[0] = 0
for i in range(1, len(ashiba)):
paths = [dp[j]+abs(ashiba[j]-ashiba[i]) for j in range(max(0, i-K), i)]
dp[i] = min(paths)
return dp[-1]
def main(args):
N, K = list(map(int, input().split()))
ashiba = [int(i) for i in input().split()]
ans = solve(ashiba, N, K)
print(ans)
if __name__ == '__main__':
main(sys.argv[1:])
| # -*- coding: utf-8 -*-
"""
"""
def chmin(i, j):
a, b = dp[i+j], dp[i]+abs(h[i]-h[i+j])
if a > b:
dp[i+j] = b
n, k = list(map(int, (input().split())))
h = list(input().split())
h = [int(i) for i in h]
dp = [10**10]*n
dp[0] = 0
for i in range(0, n):
for j in range(1, k+1):
if i+j < n:
chmin(i, j)
print((dp[n-1])) | p03161 |
import sys
n,k = list(map(int, input().split()))
l = list(map(int, input().split()))
dp = [sys.maxsize]*n
dp[0]=0
# dp[1] = abs(l[1]-l[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(l[i]-l[i-j]))
print((dp[n-1])) | import sys
n,k = list(map(int, input().split()))
l = list(map(int, input().split()))
dp = [sys.maxsize]*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(l[i]-l[i-j]))
print((dp[n-1])) | p03161 |
import sys
sys.setrecursionlimit(10 ** 7)
def solve(index: int, dp: list, footing: list, K: int) -> int:
if dp[index] != -1:
return dp[index]
if index == 0:
return 0
elif index == 1:
return abs(footing[1]-footing[0])
tmp = 10 ** 10
for k in range(1, min(K+1,index+1)):
tmp = min(tmp, solve(index-k, dp, footing, K)+abs(footing[index]-footing[index-k]))
#print(f'{tmp=}')
dp[index] = tmp
return tmp
N, K = list(map(int, input().split()))
footing = list(map(int, input().split()))
dp = [-1] * N
ans = solve(N-1, dp, footing, K)
print(ans)
| N, K = list(map(int, input().split()))
footing = list(map(int, input().split()))
dp = [10 ** 10] * N
dp = dp + [10 ** 10] * 1000
dp[0] = 0
footing = footing + [0] * 1000
# give
'''
for i in range(N-1):
for k in range(1, K+1):
if dp[i+k] > dp[i] + abs(footing[i+k] - footing[i]):
dp[i+k] = dp[i] + abs(footing[i+k] - footing[i])
print(dp[N-1])
'''
# get
for i in range(1,N):
for j in range(1,min(K+1, i+1)):
dp[i] = min(dp[i],dp[i-j] + abs(footing[i]-footing[i-j]))
print((dp[N-1]))
| p03161 |
N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
import sys
import functools
#indexi番目にいるときの最小コスト
sys.setrecursionlimit(pow(10,6))
@functools.lru_cache(None)
def func(i):
if i==0:
return 0
h = H[i]
return min(func(i-k)+abs(h-H[i-k]) for k in range(1,min(i,K)+1))
print((func(N-1))) | N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
dp = [0]*N
dp[1]= abs(H[1]-H[0])
#dp[i] インデックスiにいるときの最小値
inf = float("inf")
for i in range(1,N-1):
tmp = inf
oppai = min(K,i+1)
for jump in range(1,oppai+1):
tmp = min(tmp,dp[i+1-jump]+abs(H[i+1]-H[i+1-jump]))
dp[i+1]=tmp
print((dp[N-1]))
| p03161 |
import sys
from functools import reduce
sys.setrecursionlimit(2000000001)
def solve(n,k,ar,dp,x):
ab = abs; mn = min
if x>=n-2: return dp[x]
if not dp[x] is -1: return dp[x]
t = [ab(ar[x]-ar[i])+solve(n,k,ar,dp,i) for i in range(x+1,mn(n,x+k+1))]
dp[x] = mn(t) #reduce(lambda a,b : a if a < b else b,t)
return dp[x]
def main():
I = lambda:list(map(int,sys.stdin.readline().split()))
pr = lambda x:sys.stdout.write(f'{x}\n')
n,k, ar = *I(), [*I()]
dp = [-1]*(n-2) + [abs(ar[-2]-ar[-1]),0]
pr(solve(n,k,ar,dp,0))
main() | import sys
sys.setrecursionlimit(2000000001)
def solve(n,k,ar,dp,x):
ab = abs; mn = min
if x>=n-2: return dp[x]
if not dp[x] is -1: return dp[x]
dp[x] = mn([ab(ar[x]-ar[i])+solve(n,k,ar,dp,i) for i in range(x+1,mn(n,x+k+1))])
return dp[x]
def main():
I = lambda:list(map(int,sys.stdin.readline().split()))
pr = lambda x:sys.stdout.write(f'{x}\n')
n,k, ar = *I(), [*I()]
dp = [-1]*(n-2) + [abs(ar[-2]-ar[-1]),0]
pr(solve(n,k,ar,dp,0))
main() | p03161 |
#python3
INF = int(1e9)
def main():
n, k = list(map(int, input().split()))
h = [int(i) for i in input().split()] + [0]* 110
dp = [INF] * 100001
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-j]- h[i]))
print((dp[n-1]))
main() | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
n, k = list(map(int, readline().split()))
h = [int(i) for i in readline().split()]
#dp[i]:=i番目の柱までの経路によって加算されたコストの総和の最小値
INF = int(1e9)
dp = [INF for _ in range(n)]
def cost(i, j):
return abs(h[i]-h[j])
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]+cost(i, i+j))
print((dp[n-1]))
if __name__ == '__main__':
main()
| p03161 |
def solve():
n,k=[int(i) for i in input().split()]
h=[int(i) for i in input().split()]
dp=[0]*n
for i, hi in enumerate(h):
if i==0: continue
dp[i]=min([dp[j] + abs(hi-h[j]) for j in range(max(i-k,0),i)])
return dp[n-1]
print((solve()))
| def solve():
n,k=[int(i) for i in input().split()]
h=[int(i) for i in input().split()]
dp=[0]*n
for i, hi in enumerate(h):
if i==0: continue
x = max(0, i - k)
dp[i]=min([dpj + abs(hi-hj) for dpj, hj in zip(dp[x:i], h[x:i])])
#スライサー[x:i]で[x]～[i-1]の部分リストを取得
return dp[n-1]
print((solve()))
| p03161 |
N,K=list(map(int,input().split()))
dp=[1000000000000000]*N
h=[int(x) for x in input().split()]
dp[0]=0
for i in range(N):
dp=dp[:i] + ([x if x<dp[i]+abs(h[i+j]-h[i]) else dp[i]+abs(h[i+j]-h[i]) for j,x in enumerate(dp[i:(i+K+1 if i+K+1<N else N)])]) + (dp[i+K+1:] if i+K+1<N else [])
# for j in range(i,i+K+1 if i+K+1 < N else N):
# dp[j] = dp[j] if dp[j]<dp[i]+abs(h[j]-h[i]) else dp[i]+abs(h[j]-h[i])
print((dp[-1])) | N,K=list(map(int,input().split()))
dp=[1000000000000000 for i in range(N)]
h=[int(x) for x in input().split()]
dp[0]=0
for i in range(N):
for j in range(i,i+K+1 if i+K+1 < N else N):
dp[j] = dp[j] if dp[j]<dp[i]+abs(h[j]-h[i]) else dp[i]+abs(h[j]-h[i])
print((dp[-1])) | p03161 |
n,h=list(map(int,input().split()))
l=list(map(int,input().split()))
c=[10**9]*n
c[0]=0
c[1]=abs(l[0]-l[1])
for i in range(2,n):
c[i]=min( c[j]+abs(l[i]-l[j]) for j in range(max(0,i-h),i) )
print((c[-1]))
| 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 |
n,h=list(map(int,input().split()))
l=list(map(int,input().split()))
c=[10**9]*n
c[0]=0
c[1]=abs(l[0]-l[1])
for i in range(2,n):
for j in range(max(0,i-h),i):
c[i]=min(c[j]+abs(l[i]-l[j]),c[i])
print((c[-1])) | n,h=list(map(int,input().split()))
l=list(map(int,input().split()))
c=[10**9]*n
c[0]=0
c[1]=abs(l[0]-l[1])
for i in range(2,n):
c[i]=min( c[j]+abs(l[i]-l[j]) for j in range(max(0,i-h),i) )
print((c[-1]))
| p03161 |
a,b = list(map(int, input().split()))
b+=1
x = list(map(int, input().split()))
dp = [0]+[10**10]*(a-1)
dp = [0]+[float("inf")]*(a-1)
dp[1] = abs(x[1]-x[0])
for i,h in enumerate(x):
for j in range(i+1,min(i+b,a)):
dp[j] = min(dp[j],dp[i]+abs(h-x[j]))
#print(dp)
print((dp[a-1])) | a,b = list(map(int, input().split()))
x = list(map(int, input().split()))
#dp = [0]+[10**10]*(a-1)
dp = [0]+[float("inf")]*(a-1)
dp[1] = abs(x[1]-x[0])
for i,h in enumerate(x):
for j in range(max(0,i-b),i):
dp[i] = min(dp[i],dp[j]+abs(h-x[j]))
#print(dp)
#print(dp)
print((dp[a-1])) | p03161 |
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):
for j in range(1,min(i,k)+1):
# print(j)
dp[i]=min(dp[i],dp[i-j]+abs(H[i]-H[i-j]))
# print(dp)
# dp[i]=min(dp[i],dp[i-1]+abs(H[i]-H[i-1]))
# print(dp)
print((dp[-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(0,n-1):
for j in range(1,min(n-i-1,k)+1):
# print(j)
dp[i+j]=min(dp[i+j],dp[i]+abs(H[i]-H[i+j]))
# print(dp)
# dp[i]=min(dp[i],dp[i-1]+abs(H[i]-H[i-1]))
# print(dp)
print((dp[-1])) | p03161 |
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
n, k = list(map(int, input().split()))
h = [0] + list(map(int, input().split()))+[0]*(k+10)
INF = 10**10
dp = [INF]*(n+k+10)
dp[1] = 0
for i in range(n+1):
for j in range(1,k+1):
a = dp[i] + abs(h[i+j]-h[i])
if a < dp[i+j]:
dp[i+j] = a
print((dp[n]))
| from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
n, k = list(map(int, input().split()))
h = [0] + list(map(int, input().split()))
INF = 10**10
dp = [INF]*(n+5)
dp[1] = 0
for i in range(2,n+1):
temp = [dp[j] + abs(h[i] - h[j]) for j in range(i-1, max(0,i-k-1), -1)]
dp[i] = min(temp)
print((dp[n]))
| p03161 |
from collections import deque
INF = float('inf')
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
H = deque(list(map(int, input().split())))
max_K = 100
for _ in range(max_K):
H.append(INF)
dp = [INF] * (N + max_K)
dp[0] = 0
for n in range(N):
for offset in range(1, K + 1):
new_index = n + offset
cost = dp[n] + abs(H[n] - H[new_index])
if (dp[new_index] > cost):
dp[new_index] = cost
print((dp[N - 1]))
| import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
# H = deque(list(map(int, input().split())))
max_K = 100
H = list(map(int, input().split()))
H += [0] * max_K
# for _ in range(max_K):
# H.append(0)
dp = [float('inf')] * (N + max_K)
dp[0] = 0
for n in range(N):
for offset in range(1, K + 1):
new_index = n + offset
cost = dp[n] + abs(H[n] - H[new_index])
if (dp[new_index] > cost):
dp[new_index] = cost
print((dp[N - 1]))
| p03161 |
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, min(i, k)+1))
print((dp[-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(n):
for j in range(1, k+1):
if n <= i+j:
continue
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()))
field = list(map(int, input().split()))
dpList = [0] * N
dpList[1] = abs(field[0] - field[1])
for i in range(2, N):
tmpList = []
minCost = -1
for j in range(max(0, i-K), i):
cost = dpList[j] + abs(field[i] - field[j])
if(minCost == -1):
minCost = cost
elif minCost > cost:
minCost = cost
dpList[i] = minCost
print((dpList[-1]))
if __name__ == "__main__":
main() | def main():
N, K = list(map(int, input().split()))
field = list(map(int, input().split()))
dpList = [0] * N
dpList[1] = abs(field[0] - field[1])
for i in range(2, N):
tmpList = []
minCost = -1
minS = max(0, i - K)
for dpJ, fJ in zip(dpList[minS:i], field[minS:i]):
cost = dpJ + abs(field[i] - fJ)
if(minCost == -1):
minCost = cost
elif minCost > cost:
minCost = cost
dpList[i] = minCost
print((dpList[-1]))
if __name__ == "__main__":
main() | p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [100000000000]*N
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2,N):
for num in range(K):
if num+1<=i:
A = dp[i-num-1]+abs(h[i]-h[i-num-1])
if dp[i] >= A:
dp[i] = A
print((dp[N-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 10**18
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+j] - h[i]))
else:
break
print((dp[-1])) | p03161 |
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[i - j] + abs(h[i] - h[i - j]) for j in range(1, k + 1) if i - j >= 0)
print((dp[-1])) | 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(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[-1]))
| p03161 |
from sys import stdin
if __name__ == '__main__':
n = stdin.readline()
n, K = n.split(' ')
n = int(n)
K = int(K)
arr = stdin.readline()
arr = [int(a) for a in arr.split(' ')]
dp = [float('inf')]*n
dp[0] = 0
for i in range(n):
for k in range(1, K+1):
if i - k < 0:
break
dp[i] = min(dp[i], dp[i-k]+abs(arr[i]-arr[i-k]))
print((dp[-1])) | def main():
infinity = 1e10
n, k, height = getInputs()
cost = [infinity] * n
cost[0] = 0
cost[1] = abs(height[0] - height[1])
for i in range(2, n):
for j in range(i - 1, i - k - 1, -1):
if j >= 0:
cost[i] = min(cost[i], cost[j] + abs(height[i] - height[j]))
print((cost[-1]))
def getInputs():
n, k = [int(x) for x in input().split()]
height = tuple([int(x) for x in input().split()])
return n, k, height
main()
| p03161 |
N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
INF = 10**12
dp = [INF]*100010
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[N-1]))
| N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
INF = 10**9
dp = [INF]*100010
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[N-1]))
| p03161 |
# coding: utf-8
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [100000]*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]))
| 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 |
N,K=list(map(int,input().split()))
h=[0]*100010
h[:N]=[int(x) for x in input().split()]
dp=[float('inf')]*100100
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] - h[i+j]))
print((dp[N-1])) | N,K=list(map(int,input().split()))
h=[int(x) for x in input().split()]
dp=[float('inf')]*N
dp[0] = 0
for i, hi in enumerate(h):
if i > 0:
x = max(0,i-K)
dp[i]=min([dpj + abs(hi-hj) for dpj, hj in zip(dp[x:i], h[x:i])])
print((dp[N-1])) | p03161 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.