input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# coding: utf-8
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^5, 1 <= k <= 100
h = list(map(int, input().rstrip().split()))
dp = [0]
for i in range(1, n):
dp.append(min(dp[j] + abs(h[i] - h[j]) \
for j in range(max(i - k, 0), i)))
print((dp[-1]))
| # coding: utf-8
def f(n, k, h):
dp = [0 for _ in range(n)]
for i in range(1, n):
js = max(i - k, 0)
dp[i] = min(dp[j] + abs(h[i] - h[j]) \
for j in range(js, i))
# print(dp)
return(dp[i])
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^5, 1 ... | p03161 |
# coding: utf-8
def f(n, k, h):
dp = [float('inf') for _ in range(n)]
dp[0] = 0
for i in range(1, n):
js = max(i - k, 0)
for j in range(js, i):
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]))
return(dp[i])
n, k = list(map(int, input().rstrip().split())) # 2 <= n ... | # coding: utf-8
def f(n, k, h):
dp = [float('inf') for _ in range(n)]
dp[0] = 0
for i in range(1, n):
js = max(i - k, 0)
dp[i] = min(dp[j] + abs(h[i] - h[j]) \
for j in range(js, i))
return(dp[i])
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^... | p03161 |
# coding: utf-8
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^5, 1 <= k <= 100
h = list(map(int, input().rstrip().split()))
dp = [float('inf') for _ in range(n)]
dp[0] = 0
for i in range(1, n):
js = max(i - k, 0)
dp[i] = min(dp[j] + abs(h[i] - h[j]) \
for j in range(js, i... | # coding: utf-8
import sys
input = sys.stdin.readline
def f(n, k, h):
dp = [0] * n
for i in range(1, n):
js = max(i - k, 0)
dp[i] = min(dp[j] + abs(h[i] - h[j]) \
for j in range(js, i))
return(dp[i])
n, k = list(map(int, input().rstrip().split())) # 2 <= n <= 10^... | p03161 |
#!/usr/bin/env python3
# vim: set fileencoding=utf-8
# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation
"""Module docstring
"""
import sys
from collections import deque
def solve_samiz(values, nb, max_jump_size):
dp = [10 ** 9] * nb
dp[0] = 0
for i in ra... | #!/usr/bin/env python3
# vim: set fileencoding=utf-8
# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation
"""Module docstring
"""
import sys
def solve(values, nb, max_jump_size):
max_jump_size = min(nb, max_jump_size)
cost_to = [0]
for i in range(1, nb):
... | p03161 |
N,k = list(map(int,input().split()))
l = list(map(int,input().split()))
cost = [0] * N
for i in range(N):
temp = []
for j in range(max(0,i-k),i):
delta = cost[j]+abs(l[i]-l[j])
temp.append(delta)
cost[i] = min(temp)
print((cost[N-1])) | N,k = list(map(int,input().split()))
l = list(map(int,input().split()))
cost = [0] * N
for i in range(1,N):
temp = []
cost[i] = min([cost[j]+abs(l[i]-l[j]) for j in range(max(0,i-k),i)])
print((cost[N-1])) | p03161 |
#import numpy
[n,k] = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
dp = [0]
i_ls = []
now = 0
#dpのi番目の要素がi+1番目の足場までの最小コスト
for i in range(1,n):
#i番目の足場
if i < k:
for j in range(i):
i_ls.append(abs(a[i]-a[j])+dp[j])
#print("i<k")
else:
... | [n,k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
"""
初期条件
dp[0] = 0
dp[1] = h[1] - h[0]
"""
dp = [10 ** 9 + 7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n > 2:
for i in range(2,n):
for j in range(1,min(i - 0,k)+1):
dp[i] =min(dp[i - j] + abs(h[i]-h... | p03161 |
[n,k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
"""
初期条件
dp[0] = 0
dp[1] = h[1] - h[0]
"""
dp = [10 ** 9 + 7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n > 2:
for i in range(2,n):
for j in range(1,min(i - 0,k)+1):
dp[i] =min(dp[i - j] + abs(h[i]-h... | [n,k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
dp = [1000000000] * n
dp[0] = 0
for i in range(1,n):
for j in range(1,min(k,i)+1):
dp[i] = min(dp[i],dp[i-j] + abs(h[i] - h[i-j]))
print((dp[n-1]))
#print(dp)
| p03161 |
import math
import sys
input = sys.stdin.readline
number, jump =input().rstrip().split()
number = int(number)
jump = int(jump)
scaffolding = input().rstrip().split()
scaffolding = list(map(int, scaffolding))
res = [math.inf for i in range(number)]
res[0] =0
test = [math.inf for k in range(jump)]
test[0] = 0... | import math
import sys
input = sys.stdin.readline
number, jump =input().rstrip().split()
number = int(number)
jump = int(jump)
scaffolding = input().rstrip().split()
scaffolding = list(map(int, scaffolding))
res = [0 for i in range(number)]
res[1] = abs(scaffolding[1]-scaffolding[0])
#test = [math.inf for k i... | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int,input().split()))
if k > n:
k = n-1
'''
n番目の場所に到達する時
n-1番目から、1つ飛んでくる
n-2番目から、２つ飛んでくる
...
n-K番目から、kつ飛んでくる
可能性がある その時の最小値を考える
初期条件
dp[0] = 0
dp[1~Kまで]を計算
*** n-j
dp[n] = dp[n-j] + abs(h[n] - h[n-j])
漸化式
n >= 2
dp[n] = min(jump_list)... | n, k = list(map(int, input().split()))
h = list(map(int,input().split()))
if k > n:
k = n-1
'''
n番目の場所に到達する時
n-1番目から、1つ飛んでくる
n-2番目から、２つ飛んでくる
...
n-K番目から、kつ飛んでくる
可能性がある その時の最小値を考える
初期条件
dp[0] = 0
dp[1~Kまで]を計算
*** n-j
dp[n] = dp[n-j] + abs(h[n] - h[n-j])
漸化式
n >= 2
dp[n] = min(jump_list)... | p03161 |
size, jumps = list(map(int, input().split()))
array = list(map(int, input().split()))
dp = [999999999] * size
dp[0]= 0
dp[1] = abs(array[0]- array[1])
for i in range(2,size):
dp[i] = min(abs(array[i] - array[j]) + dp[j] for j in range(max(0, i - jumps), i))
print((dp[size-1])) | import sys
def input():
return sys.stdin.readline().strip()
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * n
dp[0] = 0
dp[1] = abs(h[0] - h[1])
for i in range(2, n):
dp[i] = min(abs(h[i] - h[j]) + dp[j] for j in r... | p03161 |
N,K = list(map(int,input().split(" ")))
H = list(map(int,input().split(" ")))
#DPテーブル作成
dp = [10**10]*(len(H)+K)
dp[0]=0
for i in range(N):
for j in range(1,K+1):
if(i+j<N):
dp[i+j]=min(dp[i+j],dp[i]+abs(H[i]-H[i+j]))
print((dp[N-1]))
#print(dp) | N,K = list(map(int,input().split(" ")))
H = list(map(int,input().split(" ")))
#DPテーブル作成
dp = [10**10]*(N)
dp[0]=0
for i,hi in enumerate(H):
if i ==0:
continue
s = i-K if i-K>=0 else 0
dp[i] = min([dpk+abs(hi-hk) for dpk,hk in zip(dp[s:i],H[s:i])])
print((dp[-1]))
#print(dp) | p03161 |
n, k = [int(e) for e in input().split()]
h = [int(e) for e in input().split()]
cost = [0] * n
for i in range(1, n):
cost[i] = min(abs(h[i] - h[j]) + cost[j] for j in range(max(0, i - k), i))
print((cost[n - 1]))
| def main():
n, k = [int(e) for e in input().split()]
h = [int(e) for e in input().split()]
cost = [0] * n
for i in range(1, n):
cost[i] = min(abs(h[i] - h[j]) + cost[j] for j in range(max(0, i - k), i))
print((cost[n - 1]))
main()
| p03161 |
# DP(貰うDP)
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[N - 1]))
main()
| # DP(貰うDP)
def main():
from builtins import abs
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[N - 1]))
main()
| p03161 |
# DP(貰うDP)
def main():
from builtins import abs, max, min, range
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[N - 1]))
main()
| def main():
from builtins import abs
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[N - 1]))
main()
| p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
s = 10**10
for j in range(1,min(i,K)+1):
s = min(s,dp[i-j]+abs(h[i]-h[i-j]))
dp[i] = s
print((dp[N-1])) | N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
DP = [0]
for i in range(1,N):
a = DP[i-1] + abs(H[i]-H[i-1])
for j in range(2,min(K,i)+1):
b = DP[i-j] + abs(H[i]-H[i-j])
a = min(a,b)
DP.append(a)
print((DP[N-1])) | p03161 |
N, K = list(map(int, input().split()))
H = [0] + list(map(int, input().split()))
DP = [0] * (N+1)
for i in range(2, N+1):
k = min(i, K+1)
DP[i] = min(DP[i-j] + abs(H[i-j] - H[i]) for j in range(1, k))
print((DP[N]))
| N, K = list(map(int, input().split()))
H = [0] + list(map(int, input().split()))
DP = [0] * (N+1)
for i in range(2, N+1):
k = max(i-K, 1)
DP[i] = min(dp + abs(h - H[i]) for dp, h in zip(DP[k:i], H[k:i]))
print((DP[N]))
| p03161 |
n, k = list(map(int, input().split()))
k = min(n - 1, k)
h = list(map(int, input().split()))
cost = [0 for _ in range(k)]
for i, hi in enumerate(h):
if i == 0: continue
(cs, hs) = (k - i, 0) if k > i else (0, i - k)
new_cost = min([ck + abs(hi - hk) for ck, hk in zip(cost[cs:], h[hs:])])
cost = ... | n, k = list(map(int, input().split()))
k = min(n - 1, k)
h = list(map(int, input().split()))
cost = [0 for _ in range(n)]
for i, hi in enumerate(h):
if i == 0: continue
st = i - k if i > k else 0
cost[i] = min([ck + abs(hi - hk) for ck, hk in zip(cost[st:i], h[st:i])])
print((cost[-1]))
| p03161 |
# Problem A - Frog 2 - Algoritmos e Grafos - MATA52
def frog2(n, h, k_max):
global stones
stones[0] = 0
stones[1] = abs(h[1] - h[0])
for i in range(2, n):
for j in range(1, min(i, k_max) + 1):
w1 = stones[i]
w2 = abs(h[i - j] - h[i])
stones[i] = min(w... | def woo(x, y):
res = [0]*x
z = list(map(int, input().split()))
for i in range(1, x):
res[i] = min(abs(z[i] - z[j]) + res[j] for j in range(max(0, i - y), i))
return res
if __name__ == '__main__':
x, y = list(map(int, input().split()))
r = woo(x, y)
f = len(r)-1
print(... | p03161 |
def woo(x, y):
res = [0]*x
z = list(map(int, input().split()))
for i in range(1, x):
res[i] = min(abs(z[i] - z[j]) + res[j] for j in range(max(0, i - y), i))
return res
if __name__ == '__main__':
x, y = list(map(int, input().split()))
r = woo(x, y)
f = len(r)-1
print(... | def main():
n, k = tuple([int(e) for e in input().split()])
arr = [int(e) for e in input().split()]
t = [float('inf')] * (n + 1)
t[0] = 0
t[1] = 0
for i in range(2, n + 1):
for j in range(1, k + 1):
if i - j <= 0:
break
l1 = t[i - j] + a... | p03161 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0] * n
t = []
for i in range(1,n):
for l in range(1,k+1):
if i - l >= 0:
t.append(abs(h[i] - h[i-l]) + dp[i-l])
else:
break
dp[i] = min(t)
t.clear()
print((dp[-1]))
#実... | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0] * n
t = []
for i in range(1,n):
for l in range(1,k+1):
if i - l >= 0:
t.append(abs(h[i] - h[i-l]) + dp[i-l])
else:
break
dp[i] = min(t)
t.clear()
print((dp[-1])) | p03161 |
def main2(N,h,K):
inf = 2**31 -1
dp = [inf] * N
dp[0] = 0
for i in range(1, N):
for k in range(1, K+1):
if i-k >= 0:
dp[i] = min(dp[i], dp[i-k] + abs(h[i-k] - h[i]))
else:
break
return dp[N-1]
N, K = list(map(int, input().s... | def main2(N,h,K):
dp = [0] * N
for i in range(1,N):
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(max(0, i-K), i)])
return dp[-1]
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
print((main2(N,h,K)))
| p03161 |
import sys
from io import StringIO
import unittest
sys.setrecursionlimit(10 ** 7)
def resolve():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10 ** 6
memo = [inf for _ in range(n)]
memo[0] = 0
for kk in range(1, min(k, n - 1) + 1):
... | import sys
from io import StringIO
import unittest
sys.setrecursionlimit(10 ** 7)
def resolve():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10 ** 9
# memo = [inf for _ in range(n)]
# memo[0] = 0
# for kk in range(1, min(k, n - 1) + 1):
... | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0]*n
for i in list(range(n))[1:]:
dp[i] = min([dp[j]+abs(h[i]-h[j]) for j in [max(0, i-ki-1) for ki in range(k)]])
print((dp[-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0]*n
for i in list(range(n))[1:]:
tmp = max(0, i-k)
dp[i] = min([dpk+abs(h[i]-hk) for dpk, hk in zip(dp[tmp:i], h[tmp:i])])
print((dp[-1])) | p03161 |
import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [float('inf')]*n
dp[0] = 0
for i in range(n):
for j in range(1,k+1):
if i-j >= 0:
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1]))
| import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [10**9]*n
dp[0] = 0
for i in range(n):
for j in range(1,k+1):
if i-j >= 0:
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1]))
| p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
dp[i]=min([dp[j] + abs(h[i]-h[j]) for j in range(max(i-k,0),i)])
print((dp[-1]))
| n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*n
def calc(n,k,h,dp):
for i in range(1,n):
dp[i]=min([dp[j] + abs(h[i]-h[j]) for j in range(max(i-k,0),i)])
calc(n,k,h,dp)
print((dp[-1]))
| p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
h+=[0]*k
inf=float('inf')
dp=[inf]*(n+k)
dp[0]=0
for i in range(n):
for j in range(1,k+1):
dp[i+j]=min(dp[i]+abs(h[i]-h[i+j]),dp[i+j])
print((dp[n-1]))
| n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[float("inf")]*n
dp[0]=0
for i in range(1,n):
for j in range(max(0,i-k),i):
dp[i]=min(dp[i],dp[j]+abs(h[i]-h[j]))
print((dp[n-1]))
| p03161 |
import sys
def mincost(n,h):
dp=[-1 for i in range(n)]
dp[n-1]=0
dp[n-2]=abs(h[n-2]-h[n-1])
for i in range(n-3,-1,-1):
mn=min(i+k+1,n)
mnm=sys.maxsize
for j in range(i+1,mn):
mnm=min(dp[j]+abs(h[j]-h[i]),mnm)
dp[i]=mnm
return dp[0]
n,k=li... | from sys import stdin, gettrace
import sys
if not gettrace():
def input():
return next(stdin)[:-1]
# def input():
# return stdin.buffer.readline()
def mincost(n,h,k):
dp=[-1 for i in range(n)]
dp[n-1]=0
dp[n-2]=abs(h[n-2]-h[n-1])
for i in range(n-3,-1,-1):
mn=min(i+k+1... | p03161 |
n,k = list(map(int,input().split()))
lst1 = list(map(int,input().split()))
dp = [float("inf") for _ in range(n)]
dp[0] = 0
for i in range(1,n):
for j in range(max(0,i-k),i):
dp[i] = min(dp[i],dp[j]+abs(lst1[i]-lst1[j]))
print((dp[-1])) | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n,k = list(map(int,readline().split()))
lst1 = list(map(int,readline().split()))
dp = [10**10 for _ in range(n)]
dp[0] = 0
for i in range(1,n):
for j in range(1,k+1):
if i-j < 0:
break
dp[i] = min(dp[i],dp[i-j]... | p03161 |
n, k, *h = list(map(int, open(0).read().split()))
h += [0] * 200
dp = [0] + [float("inf")] * 100200
for i in range(1, n):
dp[i] = min(dp[i-a] + abs(h[i] - h[i-a]) for a in range(1, k + 1))
print((dp[n - 1])) | n, k, *h = list(map(int, open(0).read().split()))
dp = [0] * n
for i in range(1, n):
dp[i] = min(dp[i-a] + abs(h[i] - h[i-a]) for a in range(1, min(i, k) + 1))
print((dp[n - 1])) | p03161 |
n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[-1]*n
dp[0]=0
if n<=x:
x=n-1
for i in range(1,x+1):
dp[i]=abs(a[i]-a[0])
for i in range(x+1,n):
min1=10**9
for j in range(i-(x),i):
if min1>dp[j]+abs(a[j]-a[i]):
min1=dp[j]+abs(a[j]... | n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
if n<=x:#ｎこのDPを作りたいのでｘが超えたらそれを変える必要がある
x=n-1#でもこれは実際甘え
dp=[-1]*n
dp[0]=0#さいしょのところは０かかる
for i in range(1,x+1):#飛べる距離までとべるところから最初の値を引く
dp[i]=abs(a[i]-a[0])
for i in range(x+1,n):#さいしょのいちから飛べないところからDPを入れる
min1=10**9
for j i... | p03161 |
import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
h = [int(x) for x in input().split()]
dp = [0] * N
for i, hi in enumerate(h):
if i == 0:
continue
if i - K < 0:
dp[i] = min(dpk + abs(hi-hk) for dpk, hk in zip(dp[:i], h[:i]))
else:
dp[i] = mi... | N, K = list(map(int, input().split()))
h = [int(_) for _ in input().split()]
dp = [float('inf')]*(N)
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2, N):
for j in range(1, K+1):
if i >= j:
dp[i] = min(dp[i-j]+abs(h[i]-h[i-j]), dp[i])
print((dp[N-1])) | p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
dp[i]=min(dp[j]+abs(h[i]-h[j]) for j in range(max(i-k,0),i))
print((dp[n-1])) | def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp=[0]*N
for i in range(1,N):
dp[i] = min(dp[g] + abs(h[i] - h[g]) for g in range(max(i-K,0), i))
print((dp[N-1]))
main()
| p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
c = [0 for i in range(n)]
for i in range(1, n):
l = max(0, i-k)
c[i] = min([c[x] + abs(h[x] - h[i]) for x in range(l, i)])
print((c[n-1]))
| n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
c = [0 for i in range(n)]
for i in range(1, n):
l = max(0, i-k)
c[i] = min(cj + abs(hj - h[i]) for hj, cj in zip(h[l:i], c[l:i]))
print((c[n-1]))
| p03161 |
import sys
import math
from collections import deque
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [[10**9 for _ in range(K+1)] for _ in range(N)]
dp[0] = [0 for _ in range(K+1)]
for i in range(N):
for l in range(K):
if i-(l+1) >= 0:
dp[i][l] = d... | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [[10**9 for _ in range(K+1)] for _ in range(N)]
dp[0] = [0 for _ in range(K+1)]
for i in range(N):
for l in range(K):
if i-(l+1) >= 0:
dp[i][l] = dp[i - (l + 1)][K] + abs(h[i] - h[i - (l + 1)])
el... | p03161 |
#
n, k=list(map(int, input().split()))
a=list(map(int, input().split()))
if n<3:
print((abs(a[0]-a[-1])))
exit()
c=[0]*n
c[-1]=0
mini=1000000
for i in reversed(list(range(n-k, n-1))):
# print(i)
c[i]=abs(a[i]-a[n-1])
mini=min(mini, c[i])
for i in reversed(list(range(n-k)))... | n, k=list(map(int, input().split()))
a=list(map(int, input().split()))
if n<3:
print((abs(a[0]-a[-1])))
exit()
c=[0]*n
c[-1]=0
mini=1000000
for i in reversed(list(range(n-k, n-1))):
# print(i)
c[i]=abs(a[i]-a[n-1])
mini=min(mini, c[i])
for i in reversed(list(range(n-k))... | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10000000000
dp = [inf] * N
dp[0] = 0
for i in range(1, N):
#mindp_i = inf
for jump in range(1, K + 1):
if i - jump >= 0:
dp[i] = min(dp[i], dp[i - jump] + abs(h[i] - h[i - jump]))
... | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = float('inf')
dp = [inf] * N
dp[0] = 0
for i in range(1, N):
mindp_i = inf
for jump in range(1, K + 1):
if i - jump >= 0:
dpcand = dp[i - jump] + abs(h[i] - h[i - jump])
#print(dpc... | p03161 |
def main(): #グローバル名前空間で大きな処理を書かない
n,k=list(map(int,input().split()))
H=["dammy"]+list(map(int,input().split()))
dp=[0]*(n+1)
for i in range(2,min(k+2,n+1)):
dp[i]=min(dp[j]+abs(H[i]-H[j]) for j in range(1,i))
for i in range(k+2,n+1):
dp[i] = min(dp[i-j]+abs(H[i]-H[i-j]) for j ... | def main():
n, k = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0] * n
for i, Hi in enumerate(H):
if i == 0:
continue
s = max(0, i-k) # iがk以下かどうかで処理が変わる.
dp[i] = min([dl + abs(hl - Hi) for dl, hl in zip(dp[s:i], H[s:i])])
prin... | p03161 |
n,k= list(map(int,input().split()))
h = [int(i) for i in input().split()]
inf = 10**7
dp = [inf]*100005
dp[0] = 0
for i in range(1,n):
dp[i] = min(dp[i-j] + abs(h[i-j] - h[i]) for j in range(1,min(k,i)+1))
print((dp[n-1])) | def main():
n,k= list(map(int,input().split()))
h = [int(i) for i in input().split()]
inf = 10**7
dp = [inf]*100005
dp[0] = 0
for i in range(1,n):
dp[i] = min(dp[i-j] + abs(h[i-j] - h[i]) for j in range(1,min(k,i)+1))
print((dp[n-1]))
main() | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
DP = [0]
for i in range(N-1):
act = float("inf")
for k in range(K):
if i-k < 0 : continue
act = min(DP[-1-k] + abs(h[i-k]-h[i+1]) , act)
DP += [act]
print((DP[-1])) | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0]
for i in range(n-1):
cnt = float("inf")
for j in range(k):
if i-j < 0: continue
cnt = min(dp[-1-j] + abs(h[i-j]-h[i+1]), cnt)
#print("i =",i,"j =",j,"i-j =",i-j,"i+j =",i+j,"cnt =",cnt)
dp.appen... | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")]*(N + 2)
dp[0] = 0
for i in range(N):
for k in range(1, K + 1):
if i < N - k:
dp[i + k] = min(dp[i + k], abs(h[i] - h[i + k]) + dp[i])
print((dp[N - 1]))
| N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")]*(N + 2)
dp[0] = 0
for i in range(N):
for k in range(1, min(K + 1, N - i)):
dp[i + k] = min(dp[i + k], abs(h[i] - h[i + k]) + dp[i])
print((dp[N - 1]))
| p03161 |
import sys
sys.setrecursionlimit(10**7)
n,k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
INF = 10 ** 9
memo = [-1]*n
memo[0] = 0
def dp(i):
if (memo[i] != -1):
return memo[i]
ans = INF
for j in range (max(0, i-k),i):
ans = min(ans, dp(j) + abs(h[i] ... | import sys
sys.setrecursionlimit(10**7)
n,k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
memo = [0]*n
for i in range(1, n):
min_k = float('inf')
min_k=min([memo[j] +abs(h[i]-h[j]) for j in range(max(0, i-k), i)])
memo[i] = min_k
print((memo[-1]))
| p03161 |
import sys
n, K = list(map(int, sys.stdin.readline().split()))
H = list(map(int, sys.stdin.readline().split()))
p = [float('inf') for _ in range(n)]
p[0] = 0
for i in range(1, n):
for k in range(1, K+1):
if i-k >=0:
tmp = abs(H[i]-H[i-k]) + p[i-k]
if p[i] > tmp:
... | #EDP-B
import sys
n, K = list(map(int, sys.stdin.readline().split()))
H = list(map(int, sys.stdin.readline().split()))
dp = [0 for i in range(n)]
#初期条件
for i in range(1, n):
dp[i] = abs(H[i]-H[i-1]) + dp[i-1]
#print(dp)
for i in range(2, n):
for k in range(1, K+1):
if i-k>=0:
dp[... | p03161 |
#DP B
import sys
N, K = list(map(int, sys.stdin.readline().split()))
H = list(map(int, sys.stdin.readline().split()))
dp = [0 for _ in range(N)]
#print(dp)
#print(H)
dp[1] = abs(H[1]-H[0])
#print(dp)
for i in range(2, N):
for k in range(1, K+1):
if i-k>=0:
tmp = abs(H[i]-H[i-k]) ... | #DP B
import sys
N, K = list(map(int, sys.stdin.readline().split()))
H = list(map(int, sys.stdin.readline().split()))
dp = [-1 for _ in range(N)]
#print(dp)
#print(H)
dp[0] = 0
#print(dp)
for i in range(1, N):
for k in range(1, K+1):
if i-k>=0:
tmp = abs(H[i]-H[i-k]) + dp[i-k]
... | p03161 |
# https://atcoder.jp/contests/dp/tasks/dp_b
# B - Frog 2
N, K = list(map(int, input().strip().split(' ')))
H = list(map(int, input().strip().split(' ')))
dp = [0] * N
for i in range(1, N):
MIN = None
for j in range(1, K + 1):
if i - j < 0:
continue
if MIN == None:
... | N,K=list(map(int,input().strip().split(" ")))
H=list(map(int,input().strip().split(" ")))
dp=[0]+[10**10]*(N-1)
for i in range(1,N):
temp=0
for j in range(i-K,i):
if j>=0:
dp[i]=min(dp[i],dp[j]+abs(H[i]-H[j]))
print((dp[-1]))
| p03161 |
import sys
#import numpy as np
#from collections import defaultdict
import math
#from collections import deque
input = sys.stdin.readline
def main():
N ,K= list(map(int,input().split()))
H = list(map(int,input().split()))
H = [0] + H
dp= [0] *(N+1)
dp = [10**5] * (N + 1)
... | import sys
#import numpy as np
#from collections import defaultdict
#import math
#from collections import deque
input = sys.stdin.readline
def main():
N ,K= list(map(int,input().split()))
H = list(map(int,input().split()))
H = [0] + H
dp= [0] *(N+1)
dp = [10**5] * (N + 1)
... | p03161 |
N, K = list(map(int, input().split()))
h = [0] + list(map(int, input().split()))
dp = [10**10 for i in range(N+1)]
dp[0] = dp[1] = 0
for i in range(1, N+1):
for k in range(1, K+1):
if i + k <= N:
dp[i+k] = min(dp[i+k], dp[i]+abs(h[i] - h[i+k]))
print((dp[N])) | N, K = list(map(int, input().split()))
h = [0] + list(map(int, input().split()))
dp = [10**10] * (N+1)
dp[0] = dp[1] = 0
for i in range(1, N+1):
for k in range(1, K+1):
if i + k <= N:
dp[i+k] = min(dp[i+k], dp[i]+abs(h[i] - h[i+k]))
print((dp[N])) | p03161 |
# B - Frog 2
import sys
sys.setrecursionlimit(10**6)
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
# 無限大の値
INF = 10**10
# DP テーブル
dp = [0]*(100010)
# DP テーブル全体を初期化
for i in range(100010):
dp[i] = INF
# 初期条件
def rec(v):
# DP の値が既に更新されていたらそのままリターン
if dp[v] ... | # B - Frog 2
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
# 無限大の値
INF = 10**10
# DP テーブル
dp = [0]*(100010)
# DP テーブル全体を初期化
for i in range(100010):
dp[i] = INF
# 初期条件
dp[0] = 0
for v in range(1,N):
for k in range(1,K+1):
# 遷移元の足場がないとき
if v-k < ... | p03161 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
final=[0]*n
if k>=n:
print((abs(l[n-1]-l[0])))
else:
for i in range(1,k+1):
final[i]=abs(l[i]-l[0])
for i in range(k+1,n):
mini=10**9+1
x=k
for j in range(1,x+1):
mini=min(mini... | n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
final=[0]*n
if k>=n:
print((abs(l[n-1]-l[0])))
else:
for i in range(1,k+1):
final[i]=abs(l[i]-l[0])
for i in range(k+1,n):
li=[abs(l[i]-l[ik])+final[ik] for ik in range(i-1,i-k-1,-1) ]
final[i]=min(li)
p... | p03161 |
import sys
input = sys.stdin.readline
N,K=(int(i) for i in input().split())
h = [int(i) for i in input().split()]
c = [0]*N
for i in range(1,N):
jumpmax = min(i,K)
c[i] = min([abs(h[i]-h[i-j])+c[i-j] for j in range(1,jumpmax+1)])
print((c[N-1])) | N,K=(int(i) for i in input().split())
h = [int(i) for i in input().split()]
c = [0]*N
for i in range(1,N):
jumpmax = min(i,K)
c[i] = min([abs(h[i]-h[i-j])+c[i-j] for j in range(1,jumpmax+1)])
print((c[N-1])) | p03161 |
#atcoder https://atcoder.jp/contests/dp/tasks/dp_b
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(
dp[k] + abs(h[i]-h[k]) for k in range(max(i-K,0), i)
)
print((dp[N-1]))
| #atcoder https://atcoder.jp/contests/dp/tasks/dp_b
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(
dp[k] + abs(h[i]-h[k]) for k in range(max(i-K,0), i)
)
... | p03161 |
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
ans=[0]*N
ans[1]=abs(h[1]-h[0])
for i in range(2,N):
ans[i] = min(abs(h[i] - h[j]) + ans[j] for j in range(max(0,i-K),i))
print((ans[N-1])) | def main():
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
ans=[0]*N
ans[1]=abs(h[1]-h[0])
for i in range(2,N):
ans[i] = min(abs(h[i] - h[j]) + ans[j] for j in range(max(0,i-K),i))
print((ans[N-1]))
main() | p03161 |
def main():
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
# 初期化
# 初期条件
# ループ
# テーブルから解を得る
INF = float('inf')
dp = [INF] * N
dp[0] = 0
for i in range(N-1):
t = min(K+1, N-i)
for j in range(1, t):
dp[i+j] = min(dp... | def main():
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
# 初期化
# 初期条件
# ループ
# テーブルから解を得る
INF = float('inf')
dp = [INF] * N
dp[0] = 0
for i in range(N-1):
for j in range(1, min(K+1, N-i)):
dp[i+j] = min(dp[i+j], dp[i]+ab... | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")] * n
dp[0] = 0
for i in range(n):
for j in range(0, min(i, k)+1):
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print((dp[-1]))
| n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
# n個の枠を作成
dp = [float("inf")] * n
# 初期値を0に
dp[0] = 0
#dp[i] =i番目まで来る最安の方法
for i in range(n):
for j in range(1, min(i, k)+1): # 上限が負にならないようにmin(i,k)で調整。+1でちゃんとrangeの癖を修正。
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j... | p03161 |
import sys
# import pdb
input = sys.stdin.readline
N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
dp_list = [-1 for _ in range(N)]
dp_list[0] = 0
dp_list[1] = abs(hs[1] - hs[0])
import heapq
sys.setrecursionlimit(1000000)
def dp_memo(p):
if dp_list[p] != -1:
return... | import sys
# import pdb
input = sys.stdin.readline
N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
inf = 1e10
dp_list = [inf for _ in range(N)]
dp_list[0] = 0
# import heapq
sys.setrecursionlimit(1000000)
def dp_memo(p):
if dp_list[p] != -1:
return dp_list[p]
... | p03161 |
import sys
# import pdb
input = sys.stdin.readline
N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
inf = 1e10
dp_list = [inf for _ in range(N)]
dp_list[0] = 0
# import heapq
sys.setrecursionlimit(1000000)
def dp_memo(i):
if dp_list[i] != inf:
return dp_list[i]
... | N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
total_cost = [-1 for i in range(N)]
total_cost[0] = 0
total_cost[1] = abs(hs[1] - hs[0])
for i in range(2, N):
for k in range(1, K+1):
if total_cost[i] == -1:
total_cost[i] = total_cost[i-k] + abs(hs[i] - hs[i-k])
... | p03161 |
N, K = list(map(int, input().split()))
hs = list(map(int, input().split()))
costs = [1e10 for _ in range(N)]
costs[0] = 0
for i in range(N):
for k in range(1, min(K+1, N-i)):
costs[i+k] = min(costs[i+k], costs[i] + abs(hs[i+k] - hs[i]))
print((costs[N-1]))
| N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
cost = [1e30 for _ in range(N)]
cost[0] = 0
for i in range(N):
for k in range(i+1, min(N, i+K+1)):
cost[k] = min(cost[k], cost[i] + abs(H[k] - H[i]))
print((cost[N-1]))
| p03161 |
N, K = list(map(int, input().split()))
H = [0] + list(map(int, input().split()))
dp = [10 ** 10] * (N+1)
dp[1] = 0
for i in range(1, N+1):
for j in range(1, K+1):
if i + j > N:
continue
dp[i+j] = min(dp[i+j], dp[i] + abs(H[i+j] - H[i]))
print((dp[N])) | N, K = list(map(int, input().split()))
H = [0] + list(map(int, input().split()))
dp = [10 ** 10] * (N+1)
dp[:2] = 0, 0
for i in range(1, N+1):
for j in range(1, K+1):
if i + j > N:
break
dp[i+j] = min(dp[i+j], dp[i] + abs(H[i+j] - H[i]))
print((dp[N])) | p03161 |
from sys import stdin,stdout
INT_MAX= 100000000
n,k=list(map(int,stdin.readline().split()))
dp = [INT_MAX]*(n)
h=[int(X) for X in stdin.readline().split()]
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
p=1
while(p<k+1 or i-p>=0):
dp[i]= min(dp[i-p+1]+abs(h[i-p+1]-h[i]),dp[i])
p+=... | from sys import stdin,stdout
INT_MAX= 10**18
n,k=list(map(int,stdin.readline().split()))
dp = [INT_MAX]*(n)
h=[int(X) for X in stdin.readline().split()]
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
p=1
while(p<k+1 and (i-p)>=0):
dp[i]= min(dp[i-p]+abs(h[i-p]-h[i]),dp[i])
p+=1
s... | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf") for _ in range(n)]
dp[0] = 0
for i in range(n-1):
for j in range(1, min(k+1, n-i)):
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print((dp[n-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf")]*n
dp[0] = 0
for i in range(1, n):
for j in range(1, k+1):
if i-j >= 0:
dp[i] = min(dp[i], dp[i-j] + abs(h[i]-h[i-j]))
print((dp[n-1])) | p03161 |
mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return list(map(int,sys.stdin.readline().split()))
def ii() : return int(sys.stdin.readline().rstrip())
de... | mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return list(map(int,sys.stdin.readline().split()))
def ii() : return int(sys.stdin.readline().rstrip())
de... | p03161 |
# @oj:atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-04-20 10:31
# @url:https://atcoder.jp/contests/dp/tasks/dp_b
import sys
def input():
return sys.stdin.readline().strip()
def main():
nk=list(map(int,input().split()))
h=list(map(int,input().split()))
n=nk[0]
k=nk[... | import sys
def input():
return sys.stdin.readline().strip()
def main():
size, jumps = list(map(int, input().split()))
array = list(map(int, input().split()))
dp = [999999999] * size
dp[0]= 0
dp[1] = abs(array[0]- array[1])
for i in range(2,size):
dp[i] = min(abs(arr... | p03161 |
# @oj:atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-04-20 10:31
# @url:https://atcoder.jp/contests/dp/tasks/dp_b
import sys
def input():
return sys.stdin.readline().strip()
def main():
nk=list(map(int,input().split()))
h=list(map(int,input().split()))
n=nk[0]
k=nk[... | # @oj:atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-04-20 10:31
# @url:https://atcoder.jp/contests/dp/tasks/dp_b
import sys
def input():
return sys.stdin.readline().strip()
def main():
nk=list(map(int,input().split()))
h=list(map(int,input().split()))
n=nk[0]
k=nk[... | p03161 |
def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = dp[i-1] + abs(h[i] - h[i-1])
for j in range(2, K+1):
if i-j < 0:
break
else:
dp[i] = min(d... | def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * n
for i in range(1, n):
j = max(0, i-k)
dp[i] = min(x + abs(h[i] - y) for x, y in zip(dp[j:i], h[j:i]))
print((dp[-1]))
return
if __name__ == '__main__':
main()... | p03161 |
n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
dp = [10**10]*n
dp[0] = 0
dp[1] = abs(l[0] - l[1])
for i in range(2,n):
for j in range(i-1,max(0,i-k)-1,-1):
tem = dp[j] + abs(l[i] - l[j])
if tem<dp[i]:
dp[i] = tem
print((dp[n-1]))
#print(dp)
... | n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
dp = [10**9]*n
dp[0] = 0
dp[1] = abs(l[0] - l[1])
for i in range(2,n):
for j in range(i-1,max(0,i-k)-1,-1):
tem = dp[j] + abs(l[i] - l[j])
if tem<dp[i]:
dp[i] = tem
print((dp[n-1]))
| p03161 |
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
dp=[0]#足場iまでの最小コスト
for i in range(1,N):
l=max(0,i-K)
#m=min([d+abs(H[i]-h) for d,h in zip(dp[l:i],H[l:i])])
m=min(list(map(lambda d,h:d+abs(H[i]-h),dp[l:i],H[l:i])))
dp.append(m)
print((dp[-1])) | N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
dp=[0]#足場iまでの最小コスト
for i in range(1,N):
l=max(0,i-K)
m=min([d+abs(H[i]-h) for d,h in zip(dp[l:i],H[l:i])])
#m=min(map(lambda d,h:d+abs(H[i]-h),dp[l:i],H[l:i]))
dp.append(m)
print((dp[-1])) | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [10 ** 9] * n
dp[0] = 0
a = min(n, k)
for i in range(n):
for j in range(1, min(k + 1, n - i)):
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print((dp[-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [10 ** 9] * n
dp[0] = 0
for i in range(1, n):
j = max(0, i - k)
hi = h[i]
dp[i] = min(dpj + abs(hi - hj) for dpj, hj in zip(dp[j:i], h[j:i]))
print((dp[-1])) | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0]
for i in range(1, N):
min_v = 1050000000
for j in range(1, K+1):
if i - j >= 0:
min_v = min(min_v, dp[i - j] + abs(H[i] - H[i - j]))
dp.append(min_v)
print((dp[N-1])) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0 for _ in range(N)]
for i in range(1, N):
r = max(0, i - K)
dp[i] = min(d + abs(H[i] - h) for h, d in zip(H[r:i], dp[r:i]))
print((dp[N-1])) | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0 for _ in range(N)]
for i, hi in enumerate(H):
if i == 0:
continue
r = max(0, i - K)
dp[i] = min(d + abs(hi - h) for d, h in zip(dp[r:i], H[r:i]))
print((dp[N-1])) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0 for _ in range(N)]
for i in range(1, N):
min_v = 1050000000
for j in range(1, K+1):
if i - j >= 0:
min_v = min(min_v, dp[i - j] + abs(H[i] - H[i - j]))
dp[i] = min_v
print((dp[N-1])) | p03161 |
def main():
n,k = list(map(int,input().split()))
h = [int(i) for i in input().split()]
INF = float('inf')
dp = [INF for i in range(n)]
dp[0] = 0
for i in range(n):
for j in range(1,k+1):
if i+j<n:
dp[i+j] = min(dp[i]+abs(h[i]-h[i+j]),dp[i+j])
... | def main():
n,k = list(map(int,input().split()))
h = [int(i) for i in input().split()]
INF = float('inf')
dp = [INF for i in range(n)]
dp[0] = 0
dp[1] = abs(h[0]-h[1])
for i in range(2,n):
dp[i] = min(dp[i-j]+abs(h[i-j]-h[i]) for j in range(1,min(i,k)+1))
print((dp[n-1]... | p03161 |
from collections import Counter
from functools import reduce
import fractions
import math
import statistics
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF(): return [float(x) for x in sys.... | from collections import Counter
from functools import reduce
import fractions
import math
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()] # LIST INT
def LF(): return [float(x) for x in sys.stdin.readline().sp... | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 10 ** 12
dp = [INF] * 100010
dp[0] = 0
for i in range(1, N):
for j in range(1, K+1):
if i - j >= 0:
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
print((dp[N-1]))
| N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 10 ** 10
dp = [INF] * 100010
dp[0] = 0
for i in range(N):
for j in range(1, K+1):
if i >= j:
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
print((dp[N-1])) | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 1001001001
dp = [inf] * (n+1)
dp[0] = 0
dp[1] = abs(h[0]-h[1])
for i in range(n):
for j in range(i + k):
if i + j >= n:
break
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]))
print((dp... | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 1001001001
dp = [inf] * (n+1)
dp[0] = 0
dp[1] = abs(h[0]-h[1])
for i in range(n):
for j in range(k):
if i + j >= n:
break
dp[i + j] = min(dp[i + j], dp[i-1] + abs(h[i+j] - h[i-1]))
print((dp[n... | p03161 |
if __name__ == '__main__':
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
hs = list(map(int, input().split()))
if n <= k+1:
print((abs(hs[0]-hs[-1])))
exit()
ans_list = [0]*n
last_hs = hs[-1]
for i in range(1,k+1):
ans_list... | if __name__ == '__main__':
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
hs = list(map(int, input().split()))
if n <= k+1:
print((abs(hs[0]-hs[-1])))
exit()
ans_list = [0]*n
last_hs = hs[-1]
for i in range(1,k+2):
ans_list... | p03161 |
if __name__ == '__main__':
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
INF = 10**9
dp = [INF] * (n+1)
dp[0] = 0
k = min(k,n)
for i in range(1,n):
for j in range(1,k+1):
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1... | if __name__ == '__main__':
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
#TLE pypy
INF = 10**9
dp = [INF] * (n+1)
dp[0] = 0
k = min(k,n)
for i in range(1,n):
for j in range(1,k+1):
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
... | p03161 |
n, k = list(map(int, input().split()))
# 2237
H = list(map(int, input().split()))
dp = [float("inf")]*(n+2)
dp[0] = 0
for i in range(n):
for j in range(1, k+1):
if i+j >= n:
break
dp[i+j] = min(dp[i+j], dp[i]+abs(H[i]-H[i+j]))
print((dp[n-1]))
| n, k = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [float("inf")]*(n+2)
dp[0] = 0
for i in range(n):
for j in range(1, k+1):
if i+j >= n:
break
dp[i+j] = min(dp[i+j], dp[i]+abs(H[i]-H[i+j]))
print((dp[n-1]))
| p03161 |
# Educational DP Contest B-Frog 2
def frog(N, K, h):
# initialize
inf = float('inf')
dp = [inf] * N
minKN = min(K, N)
for i in range(minKN):
if i == 0:
dp[i] = 0
else:
dp[i] = abs(h[0] - h[i])
for j in range(minKN):
... | # ducational DP Contest B-Frog 2
N, K = list(map(int, input().split()))
h = list(map(int, input().split())) + [0]*K
dp = [float('inf') for _ in range(N+K)]
dp[0] = 0
for i in range(N):
for j in range(1, K+1):
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print((dp[N-1])) | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
# DP
inf = float("inf")
dp = [inf for _ in range(N)]
dp[0] = 0
for i in range(1, N):
for k in range(1, K+1):
if i - k < 0:
break
dp[i] = min(dp[i], dp[i-k] + abs(h[i] - h[i-k]))
print((dp[-1])) | # Frog2
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = float("inf")
dp = [inf for _ in range(N)]
dp[0] = 0
for i in range(N):
for j in range(1, K+1):
if i + j >= N:
break
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i+j]))
print((dp[-1])) | p03161 |
import heapq
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
dp[1] = dp[0] + abs(h[1]-h[0])
for i in range(2, N):
compare = []
heapq.heapify(compare)
cnt = min(K, i)
for j in range(cnt):
heapq.heappush(compare, dp[i-j-1] + abs(h[i]-h[i-j-1])... | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
dp[1] = dp[0] + abs(h[1]-h[0])
for i in range(2, N):
compare = []
cnt = min(K, i)
for j in range(cnt):
compare.append(dp[i-j-1] + abs(h[i]-h[i-j-1]))
dp[i] = min(compare)
print((dp[-1]))
| p03161 |
n,k = list(map(int,input().split(' ')))
h = list(map(int, input().split(' ')))
dp = [0]*n
for i in range(1,n):
temp = dp[i-1]+abs(h[i]-h[i-1])
for j in range(2,k+1):
if i-j>=0:
temp = min(dp[i-j]+abs(h[i]-h[i-j]), temp)
dp[i] = temp
print((dp[-1])) | n,k = list(map(int,input().split(' ')))
h = list(map(int, input().split(' ')))
dp = [0]*n
for i in range(1,n):
dp[i] = dp[i-1]+abs(h[i]-h[i-1])
for j in range(2,k+1):
if i-j>=0:
dp[i] = min(dp[i-j]+abs(h[i]-h[i-j]), dp[i])
print((dp[-1])) | p03161 |
#!/usr/bin/env python3
import sys
def solve(N: int, K: int, h: "List[int]"):
cumsums = [float("inf")]*N
cumsums[0]=0
cumsums[1]=abs(h[1]-h[0])
for i in range(1, N):
for j in range(1, K+1):
if i >= j:
cumsums[i] = min(cumsums[i], cumsums[i-j]+abs(h[i]-h[i-... | import sys
def solve(N: int, K: int, h: "List[int]"):
cumsums = [float("inf")]*N
cumsums[0]=0
cumsums[1]=abs(h[1]-h[0])
for i in range(1, N):
for j in range(1, K+1):
if i >= j:
cumsums[i] = min(cumsums[i], cumsums[i-j]+abs(h[i]-h[i-j]))
#print(cum... | p03161 |
n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
INF = 10**10
dp = [INF] * n
dp[0] = 0
# dp[i] = (足場iにたどり着いた時点でのコストの最小値)
for i in range(n):
for j in range(i + 1, min(i + k + 1, n)):
if dp[j] > dp[i] + abs(h[j] - h[i]):
dp[j] = dp[i] + abs(h[j] - h[i])
p... | n, k = list(map(int, input().split()))
h = tuple(map(int, input().split()))
INF = 10**10
dp = [INF] * n
dp[0] = 0
# dp[i] = (足場iにたどり着いた時点でのコストの最小値)
for i in range(1, n):
dp[i] = min(dp[j] + abs(h[j] - h[i]) for j in range(max(0, i - k), i))
print((dp[n - 1]))
| p03161 |
import sys
input = sys.stdin.readline
n,k = list(map(int,input().split()))
h = tuple(map(int,input().split()))
dp = [0] + [float("inf")]*(n-1)
for i in range(1,n):
for j in range(max(0,i-k),i):
dp[i] = min(dp[i],dp[j]+abs(h[i]-h[j]))
print((dp[-1])) | n, k = list(map(int,input().split()))
h = list(map(int, input().split()))
dp = [0] + [float("inf")]*(n-1)
for i in range(1, n):
for j in range(max(0, i-k), i):
dp[i] = min(dp[i], dp[j]+abs(h[i]-h[j]))
print((dp[-1])) | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float('Inf')] * n
dp[0] = 0
for i in range(n):
for j in range(i+1, i+k+1):
if j < n:
dp[j] = min(dp[j], dp[i]+abs(h[i]-h[j]))
print((dp[-1])) | import sys
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [sys.maxsize] * n
dp[0] = 0
for i in range(n):
for j in range(i+1, i+k+1):
if j < n:
dp[j] = min(dp[j], dp[i]+abs(h[i]-h[j]))
print((dp[-1])) | p03161 |
def main():
N, K = list(map(int,input().split()))
h = [int(v) for v in input().split()]
dp = [0 for _ in range(N)]
dp[1] = abs(h[0] - h[1])
for i in range(2, N):
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(i - K, i) if j >= 0])
print((dp[-1]))
if __na... | def main():
N, K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0] * N
dp[1] = abs(h[0] - h[1])
for i in range(2, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print((dp[-1]))
if __name__ == '__main__':
... | p03161 |
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0]*N
for i in range(1,N):
dp[i]= min(abs(h[i]-h[j])+dp[j] for j in range(max(0,i-K),i))
print((dp[-1])) | def main():
N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [0]*N
for i in range(1,N):
dp[i]= min(abs(h[i]-h[j])+dp[j] for j in range(max(0,i-K),i))
print((dp[-1]))
main() | p03161 |
N,K = list(map(int, input().split()))
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
mn = 999999999999999999
for j in range(1,K+1):
if i-j >= 0:
mn = min(mn,dp[i - j] + abs(lst[i] - lst[i - j]))
else:
break
dp[i] = mn
... | N,K = list(map(int, input().split()))
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
mn = 999999999999999999
for j in range(max(i-K,0), i):
mn = min(mn,dp[j] + abs(lst[i] - lst[j]))
dp[i] = mn
print((dp[-1])) | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
# 最小なものにコストを書き換えたいので初期値は大きく取る
dp = [float('inf')] * N
# 最初はコスト０
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[j] + abs(H[i] - H[j]) for j in range(max(i - K, 0), i))
print((int(dp[i])))
| def test():
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [float('inf')]*N
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[j] + abs(H[i] - H[j]) for j in range(max(i-K, 0), i))
print((dp[-1]))
if __name__ == '__main__':
test() | p03161 |
import math
import bisect
import heapq
from collections import deque
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
d = [float('inf')] * n
d[0] = 0
for j in range(1, n):
p = [d[i] + abs(h[j] - h[i]) for i in range(max(0, j - k), j)]
d[j] = min(p)
print((d[n - 1... | import math
import bisect
import heapq
from collections import deque
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
d = [float('inf')] * n
d[0] = 0
for j in range(1, n):
p = [d[i] + abs(h[j] - h[i]) for i in range(max(0, j - k), j)]
... | p03161 |
import math
import bisect
import heapq
from collections import deque
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10**7
d = [inf] * n
d[0] = 0
for j in range(1, n):
p = [d[i] + abs(h[j] - h[i]) for i in range(max(0, j - k),... | # import math
# import bisect
# import heapq
# from collections import deque
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
inf = 10**7
d = [inf] * n
d[0] = 0
for j in range(1, n):
p = [d[i] + abs(h[j] - h[i]) for i in range(max(0,... | p03161 |
from sys import stdin
N,K=list(map(int,stdin.readline().split()))
h=[int(i) for i in stdin.readline().split()][:N]
dp=[float('inf')]*N
dp[0]=0
for i in range(N):
for j in range(i+1,i+K+1):
if j<N:
dp[j]=min(dp[j],dp[i]+abs(h[j]-h[i]))
#print(dp)
print((dp[-1])) | from sys import stdin
N,K=list(map(int,stdin.readline().split()))
h=[int(i) for i in stdin.readline().split()][:N]
dp=[float('inf') for i in range(N)]
dp[0]=0
for i in range(N):
for j in range(i+1,i+K+1):
if j<N:
dp[j]=min(dp[j],dp[i]+abs(h[j]-h[i]))
#print(dp)
print((dp[-1])) | p03161 |
from collections import deque
def solve(n,k,arr):
q,cost_=deque([ (0,0) ]),float('inf') # (idx,cost)
last_level=0
while q:
for _ in range(len(q)):
idx,cost=q.popleft()
if idx==n-1:
cost_=min(cost_,cost)
last_level=1
else:
... | def solve(n,k,arr):
if n==1:
return 0
else:
dp=[float('inf') for _ in range(n)]
dp[0]=0
for i in range(n):
for j in range(i+1,i+k+1):
if j<n:
dp[j]=min(
dp[j], dp[i]+abs(arr[i]-arr[j])
... | p03161 |
inf = float('inf')
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [inf] * n
dp[0] = 0
for i in range(1, n):
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]) for j in range(1, k + 1) if i - j >= 0)
print((dp[n - 1]))
| inf = float('inf')
n, k = list(map(int, input().split()))
h = list(map(int, input().split())) + [inf] * k
dp = [inf] * (n + k)
dp[0] = 0
# 配る
for i in range(n - 1):
for j in range(1, k + 1):
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]))
print((dp[n - 1]))
| p03161 |
def solve(n,k,ar):
dp = [int(1e9)]*n
dp[0] = 0
for i in range(n):
for j in range(i+1,i+k+1):
if j < n:
dp[j] = min(dp[j], dp[i] + abs(ar[i]-ar[j]))
print((dp[n-1]))
def solve1(n,k,ar):
dp = [int(1e9)] * (n)
dp[0] = 0
for i in range(1,n):
... | import sys
def solve(n,k,ar):
dp = [sys.maxsize]*n
dp[0] = 0
for i in range(n):
for k in range(1,k+1):
if i+k <= n-1:
dp[i+k] = min(dp[i+k], dp[i] + abs(ar[i]-ar[i+k]))
print((dp[n-1]))
if __name__ == '__main__':
n,k = list(map(int,input().... | p03161 |
def solve():
N, K = list(map(int, input().split(" ")))
h = input().split(" ")
h = [int(number) for number in h]
minimumCostToReach = [0 for i in range(N)]
minimumCostToReach[0] = 0
for currentIndex in range(1, N):
minimumCostToReach[currentIndex] = 1000000000
for previousIndex in range... | def solve():
N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
minimumCost = [0] * N
for currentIndex in range(1, N):
minimumCost[currentIndex] = min(minimumCost[previousIndex] + abs(h[currentIndex] - h[previousIndex]) for previousIndex in range(max(currentIndex - K, 0)... | p03161 |
## necessary imports
import sys
input = sys.stdin.readline
from math import log2, log, ceil
# swap_array function
def swaparr(arr, a,b):
temp = arr[a];
arr[a] = arr[b];
arr[b] = temp
## gcd function
def gcd(a,b):
if a == 0:
return b
return gcd(b%a, a)
## nCr function effi... | ## necessary imports
#import sys
#input = sys.stdin.readline
#from math import log2, log, ceil
# swap_array function
def swaparr(arr, a,b):
temp = arr[a];
arr[a] = arr[b];
arr[b] = temp
## gcd function
def gcd(a,b):
if a == 0:
return b
return gcd(b%a, a)
## nCr function e... | p03161 |
#!/mnt/c/Users/moiki/bash/env/bin/python
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
suml = [1e9 for i in range(N)]
suml[0] = 0
for e in range(1,N):
# for k in range(1, min([e, K])+1):
# suml[e] = min(suml[e],
# abs(h[e]-h[e-k]) + suml[e-k]
# ... | #!/mnt/c/Users/moiki/bash/env/bin/python
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
# suml = [1e9 for i in range(N)]
# suml[0] = 0
suml = [0]*N
for e in range(1,N):
# for k in range(1, min([e, K])+1):
# suml[e] = min(suml[e],
# abs(h[e]-h[e-k]) +... | p03161 |
n, k = tuple(map(int, input().split()))
hs = list(map(int, input().split()))
cs = [0 for _ in range(k)]
k_i = 0
for i in range(1, n):
if i < k:
cs[i] = min([cs[j] + abs(hs[j] - hs[i]) for j in range(i)])
else:
k_i = i % k
cs[k_i] = min([
cs[(k_i - j - 1) % k] + abs(... | n, k = list(map(int, input().split()))
hs = list(map(int, input().split()))
dp = [0] + [float("inf") for _ in range(n - 1)]
for i in range(1, n):
for j in range(1, min(i, k) + 1):
dp[i] = min(dp[i], dp[i - j] + abs(hs[i - j] - hs[i]))
print((dp[i])) | p03161 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[float('inf')]*n
dp[0]=0
for i in range(0,n):
for j in range(1,k+1):
if i+j>n-1:
continue
dp[i+j]=min(dp[i+j],dp[i]+abs(a[i]-a[i+j]))
print((dp[-1])) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
dp=[10**9]*(n)
dp[0]=0
for i in range(1,n):
for j in range(1,k+1):
if i-j<0:
continue
dp[i]=min(dp[i],dp[i-j]+abs(a[i]-a[i-j]))
print((dp[n-1])) | p03161 |
# import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(eval(input()))
def main():
N, K = geta(int)
h = geta(int)
INF = 1 << 60
dp = [INF for _ in range(N)]
dp[0], dp[1] = 0, abs(h[0] - h[1]... | # import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(eval(input()))
def main():
N, K = geta(int)
h = geta(int)
INF = 1 << 60
dp = [INF]*N
dp[0], dp[1] = 0, abs(h[0] - h[1])
for i i... | p03161 |
# import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(eval(input()))
def main():
N, K = geta(int)
h = geta(int)
INF = 1 << 60
dp = [INF]*N
dp[0], dp[1] = 0, abs(h[0] - h[1])
for ... | # import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(eval(input()))
def main():
N, K = geta(int)
h = geta(int)
INF = 1 << 60
dp = [INF]*N
dp[0], dp[1] = 0, abs(h[0] - h[1])
for i i... | p03161 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.