input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N=int(eval(input()))
h=list(map(int, input().split()))
dp=[0]*N
for i in range(N):
if i==0:
dp[i]=0
elif i==1:
dp[i]=abs(h[i]-h[i-1])
else:
dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
print((dp[-1])) | N=int(eval(input()))
h=list(map(int, input().split()))
dp=[10000000000000]*(N+2)
#初期状態
dp[0]=0
#配るDP
for i in range(N):
try:
dp[i+1]=min(dp[i+1],dp[i]+abs(h[i+1]-h[i]))
except IndexError:
pass
try:
dp[i+2]=min(dp[i+2],dp[i]+abs(h[i+2]-h[i]))
except IndexError:
pass
print((dp[N-1])) | p03160 |
def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
a = list(map(int, input().rstrip('\n').split()))
ls = [0] * n
for i in range(1, n):
if i == 1:
ls[i] = abs(a[i] - a[i-1])
else:
ls[i] = min(ls[i-1] + abs(a[i] - a[i-1]), ls[i-2] + abs(a[i] - a[i-2]))
print((ls[-1]))
if __name__ == '__main__':
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
h = list(map(int, readline().split()))
dp = [10 ** 10] * n
dp[0] = 0
for i in range(1, n):
if i == 1:
dp[i] = min(dp[i-1] + abs(h[i-1] - h[i]), dp[i])
else:
dp[i] = min(dp[i-1] + abs(h[i-1] - h[i]), dp[i-2] + abs(h[i-2] - h[i]), dp[i])
print((dp[-1]))
if __name__ == '__main__':
solve()
| p03160 |
n = int(eval(input()))
hs = list(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
d1 = a + abs(hs[i] - hs[i-2])
d2 = b + abs(hs[i] - hs[i-1])
a, b = b, d1 if d1 <= d2 else d2
print(b) | def main():
n = int(eval(input()))
hs = tuple(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
d1 = a + abs(hs[i] - hs[i-2])
d2 = b + abs(hs[i] - hs[i-1])
a, b = b, d1 if d1 <= d2 else d2
print(b)
if __name__ == "__main__":
main() | p03160 |
def main():
n = int(eval(input()))
hs = tuple(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
d1 = a + abs(hs[i] - hs[i-2])
d2 = b + abs(hs[i] - hs[i-1])
a, b = b, d1 if d1 <= d2 else d2
print(b)
if __name__ == "__main__":
main() | def main():
n = int(eval(input()))
hs = tuple(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
c = hs[i]
d1 = a + abs(c - hs[i-2])
d2 = b + abs(c - hs[i-1])
a, b = b, d1 if d1 <= d2 else d2
print(b)
if __name__ == "__main__":
main() | p03160 |
N = int(eval(input()))
H = list(map(int,input().split()))
INF = float('inf')
dp = [INF] * N
dp[0] = 0
for i in range(1,N):
dp[i] = min(dp[i], dp[i-1] + abs(H[i] - H[i-1]))
if i > 1:
dp[i] = min(dp[i], dp[i-2] + abs(H[i] - H[i-2]))
print((dp[-1])) | N = int(eval(input()))
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-2] + abs(H[i-2]-H[i]), dp[i-1] + abs(H[i-1]-H[i]))
print((dp[-1])) | p03160 |
def main():
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [float('inf')] * (N + 5)
dp[0] = 0
for i in range(N):
if i + 1 <= N - 1:
dp[i+1] = min(dp[i+1], dp[i] + abs(H[i+1] - H[i]))
if i + 2 <= N - 1:
dp[i+2] = min(dp[i+2], dp[i] + abs(H[i+2] - H[i]))
print((dp[N-1]))
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
H = list(map(int, input().split()))
dp = [float('inf')] * (N + 5)
dp[0] = 0
for i in range(1,N):
dp[i] = min(dp[i], dp[i-1] + abs(H[i] - H[i-1]))
if i - 2 >= 0:
dp[i] = min(dp[i], dp[i-2] + abs(H[i] - H[i-2]))
print((dp[N-1]))
if __name__ == "__main__":
main() | p03160 |
n=int(eval(input()))
a=list(map(int,input().split()))
# dp には 足場(i)へ至る最小コストが入る。
dp=[float("inf")]*(n)
dp[0]=0
for i in range(n-1):
dp[i+1]=min(dp[i+1],dp[i]+abs(a[i]-a[i+1]))
if i+2 < n:
dp[i+2]=min(dp[i+2],dp[i]+abs(a[i]-a[i+2]))
print((dp[-1]))
| # 参考：
# https://qiita.com/drken/items/dc53c683d6de8aeacf5a
# ver 2,振り返る DP
n=int(eval(input()))
a=list(map(int,input().split()))
# dp には 足場(i)へ至る最小コストが入る。
dp=[float("inf")]*(n)
# 振り返り起点(i==2)までのdp値は埋めておく。
dp[0]=0
dp[1]=abs(a[1]-a[0])
for i in range(2,n):
dp[i]=min(dp[i-1]+abs(a[i]-a[i-1]), dp[i-2]+abs(a[i]-a[i-2]))
print((dp[-1]))
| p03160 |
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[float('inf')]*(n+1)
dp[1]=0
dp[0]=0
dp[2]=dp[1]+abs(h[1]-h[0])
for i in range(1,n-1):
dp[i+2]=min(dp[i+1]+abs(h[i+1]-h[i]),dp[i]+abs(h[i+1]-h[i-1]))
print((dp[n])) | n=int(eval(input()))
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):
dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
#print(dp)
print((dp[n-1])) | p03160 |
import sys
sys.setrecursionlimit(10 ** 7)
def solve(index: int, dp: list, footing: list) -> int:
if dp[index] != -1:
return dp[index]
if index == 0:
return 0
elif index == 1:
return abs(footing[1]-footing[0])
tmp = min(solve(index-1, dp, footing)+abs(footing[index]-footing[index-1]), solve(index-2, dp, footing)+abs(footing[index]-footing[index-2]))
#print(f'{tmp=}')
dp[index] = tmp
return tmp
N = int(eval(input()))
footing = list(map(int, input().split()))
dp = [-1] * N
ans = solve(N-1, dp, footing)
print(ans) |
N = int(eval(input()))
footing = list(map(int, input().split()))
dp = [10 ** 10] * N
dp[0] = 0
# give
for i in range(N-1):
if dp[i+1] > dp[i] + abs(footing[i+1] - footing[i]):
dp[i+1] = dp[i] + abs(footing[i+1] - footing[i])
if i < N-2:
if dp[i+2] > dp[i] + abs(footing[i+2] - footing[i]):
dp[i+2] = dp[i] + abs(footing[i+2] - footing[i])
print((dp[N-1])) | p03160 |
N = int(eval(input()))
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
if i==1:
return abs(H[0]-H[1])
return min(func(i-1)+abs(H[i]-H[i-1]),func(i-2)+abs(H[i-2]-H[i]))
print((func(N-1)))
| N = int(eval(input()))
H = list(map(int,input().split()))
dp = [0]*N
dp[1]= abs(H[1]-H[0])
#dp[i] インデックスiにいるときの最小値
for i in range(1,N-1):
dp[i+1]=min(dp[i]+abs(H[i+1]-H[i]),dp[i-1]+abs(H[i+1]-H[i-1]))
print((dp[N-1])) | p03160 |
n = int(eval(input()))
h = tuple(map(int, input().split()))
c = [0] * n
c[0] = 0
c[1] = abs(h[0] - h[1])
for i in range(2, n):
c[i] = min(c[i - 1] + abs(h[i - 1] - h[i]), c[i - 2] + abs(h[i - 2] - h[i]))
print((c[-1]))
| n = int(eval(input()))
hs = tuple(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
c = hs[i]
a, b = b, min(a + abs(c - hs[i-2]), b + abs(c - hs[i-1]))
print(b)
| p03160 |
def main():
n = int(eval(input()))
hs = tuple(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
c = hs[i]
a, b = b, min(a + abs(c - hs[i-2]), b + abs(c - hs[i-1]))
print(b)
if __name__ == "__main__":
main() | def main():
n = int(eval(input()))
hs = tuple(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
d1 = a + abs(hs[i] - hs[i-2])
d2 = b + abs(hs[i] - hs[i-1])
a, b = b, min(d1, d2)
print(b)
if __name__ == "__main__":
main()
| p03160 |
def main():
n = int(eval(input()))
hs = tuple(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
d1 = a + abs(hs[i] - hs[i-2])
d2 = b + abs(hs[i] - hs[i-1])
a, b = b, min(d1, d2)
print(b)
if __name__ == "__main__":
main()
| def main():
n = int(eval(input()))
hs = tuple(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
d1 = a + abs(hs[i] - hs[i-2])
d2 = b + abs(hs[i] - hs[i-1])
a, b = b, d1 if d1 <= d2 else d2
print(b)
if __name__ == "__main__":
main()
| p03160 |
a = int(eval(input()))
b = 2#int(input())
x = list(map(int, input().split()))
dp = [0]+[10**10]*(a-1)
dp[1] = abs(x[1]-x[0])
for i,h in enumerate(x):
if i<a-b:
for di in range(1,b+1):
dp[i+di] = min(dp[i+di],dp[i]+abs(h-x[i+di]))
elif i <=a-b:
dp[i+1] =min(dp[i+1],dp[i]+abs(h-x[i+1]))
#print(dp)
print((dp[a-1])) | a = int(eval(input()))
b = 2+1#int(input())
x = list(map(int, input().split()))
dp = [0]+[10**10]*(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])) | p03160 |
N = int(eval(input()))
hlist = list(map(int, input().split()))
cost = [-1 for _ in range(N)]
cost[0] = 0
cost[1] = abs(hlist[1] - hlist[0])
#再帰
"""
def function(n)
if 終了条件 return 初項
return function(n-1)を処理したもの
"""
def dp(n):
#print(n)
if n==0: return cost[0]
elif n==1: return cost[1]
else: return min(dp(n-1)+abs(hlist[n]-hlist[n-1]), dp(n-2)+abs(hlist[n]-hlist[n-2]))
for i in range(N):
cost[i] = dp(i)
print((cost[-1])) | N = int(eval(input()))
hlist = list(map(int, input().split()))
cost = [-1 for _ in range(N)]
def dp(n):
if n==0: return 0
if n==1: return abs(hlist[1] - hlist[0])
else: return min(cost[n-1]+abs(hlist[n]-hlist[n-1]), cost[n-2]+abs(hlist[n]-hlist[n-2]))
for i in range(N):
cost[i]=dp(i)
print((cost[-1])) | p03160 |
import math
import sys
sys.setrecursionlimit(100000000)
# N = 4
# HRR = [10, 30, 40, 20]
# # N = 2
# HRR = [10, 10]
N = int(eval(input()))
HRR = list(map(int,input().split()))
result = []
def calculate(pos, cost):
if pos == N-1:
result.append(int(cost))
return
if pos + 1 <= N - 1:
calculate(pos + 1, cost + math.fabs(HRR[pos + 1] - HRR[pos]))
if pos + 2 <= N - 1:
calculate(pos + 2,cost + math.fabs(HRR[pos + 2] - HRR[pos]))
calculate(0, 0)
print((min(result))) | # N = 4
# HRR = [10, 30, 40, 20]
# N = 2
# HRR = [10, 10]
N = int(eval(input()))
HRR = list(map(int,input().split()))
result = []
for i in range(N):
if i == 0:
result.append(0)
elif i == 1:
s1 = result[i - 1] + abs(HRR[i] - HRR[i - 1])
result.append(s1)
else:
s1 = result[i - 1] + abs(HRR[i] - HRR[i - 1])
s2 = result[i - 2] + abs(HRR[i] - HRR[i - 2])
result.append(min(s1, s2))
print((result[-1]))
| p03160 |
# N = 4
# HRR = [10, 30, 40, 20]
# N = 2
# HRR = [10, 10]
N = int(eval(input()))
HRR = list(map(int,input().split()))
result = []
for i in range(N):
if i == 0:
result.append(0)
elif i == 1:
s1 = result[i - 1] + abs(HRR[i] - HRR[i - 1])
result.append(s1)
else:
s1 = result[i - 1] + abs(HRR[i] - HRR[i - 1])
s2 = result[i - 2] + abs(HRR[i] - HRR[i - 2])
result.append(min(s1, s2))
print((result[-1]))
| N = int(eval(input()))
HRR = list(map(int,input().split()))
def calculate(n, hrr):
result = []
for index,value in enumerate(hrr):
if index == 0:
result.append(0)
elif index == 1:
result.append(abs(hrr[index]-hrr[index-1]) + result[index-1])
else:
s1 = abs(hrr[index] - hrr[index-1]) + result[index - 1]
s2 = abs(hrr[index] - hrr[index-2]) + result[index - 2]
result.append(min(s1,s2))
print((result[-1]))
calculate(N,HRR)
| p03160 |
import sys
sys.setrecursionlimit(10**6)
n = int(eval(input()))
h = list(map(int, input().split()))
memo = [-1] * n
def cost(i):
if i == 0:
return 0
elif i == 1:
return abs(h[i]-h[i-1])
else:
if memo[i-1] == -1:
return min(cost(i-1)+abs(h[i-1]-h[i]), cost(i-2)+abs(h[i-2]-h[i]))
print((cost(n-1))) | n = int(eval(input()))
h = list(map(int, input().split()))
h = [0] + h
a = [0] * (n+1)
a[1] = 0
a[2] = abs(h[1]-h[2])
for i in range(3, n+1):
a[i] = min(a[i-2]+abs(h[i-2]-h[i]), a[i-1]+abs(h[i-1]-h[i]))
print((a[n]))
| p03160 |
N = int(eval(input()))
h = list(map(int, input().split()))
INF = 10 ** 9
dp = [INF] * N
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
dp1 = dp[i - 1] + abs(h[i] - h[i - 1])
dp[i] = min(dp[i], dp1)
dp2 = dp[i - 2] + abs(h[i] - h[i - 2])
dp[i] = min(dp[i], dp2)
print((dp[-1])) | N = int(eval(input()))
h = list(map(int, input().split()))
INF = 10 ** 9
dp = [INF] * N
dp[0] = 0
for i in range(N - 2):
dp1 = dp[i] + abs(h[i + 1] - h[i])
dp[i + 1] = min(dp[i + 1], dp1)
dp2 = dp[i] + abs(h[i + 2] - h[i])
dp[i + 2] = min(dp[i + 2], dp2)
dp1 = dp[-2] + abs(h[-1] - h[-2])
dp[-1] = min(dp[-1], dp1)
print((dp[-1])) | p03160 |
N = int(eval(input()))
h = list(map(int, input().split()))
INF = 10 ** 9
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
if i == 1:
dp[i] = abs(h[i] - h[i - 1])
else:
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[-1])) | N = int(eval(input()))
h = list(map(int, input().split()))
INF = 10 ** 9
dp = [INF] * N
dp[0] = 0
for i in range(N - 1):
if i == N - 2:
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]))
else:
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]))
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]))
print((dp[-1])) | p03160 |
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
h = list(map(int,input().split()))
N -= 1
def step(i):
if i == 0:
return 0
elif i == 1:
return abs(h[1]-h[0])
elif step(i-1)+abs(h[i-1]-h[i]) <= step(i-2)+abs(h[i-2]-h[i]):
return step(i-1) + abs(h[i-1]-h[i])
else:
return step(i-2) + abs(h[i-2]-h[i])
print((step(N)))
| N = int(eval(input()))
h = list(map(int,input().split()))
dp = [0]*N
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2,N):
dp[i] = min(dp[i-2]+abs(h[i]-h[i-2]),dp[i-1]+abs(h[i]-h[i-1]))
print((dp[N-1])) | p03160 |
n = int(eval(input()))
h = list(map(int,input().split()))
dp = [10001] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
a = [[-1] * n for i in range(n)]
def chmin(a, b):
if a <= b:
pass
else:
a = b
return a
for i in range(2, n):
if a[i - 2][i] == -1:
a[i][i - 2] = a[i - 2][i] = abs(h[i - 2] - h[i])
if a[i - 1][i] == -1:
a[i][i - 1] = a[i - 1][i] = abs(h[i - 1] - h[i])
dp[i] = chmin(dp[i],dp[i - 2] + a[i - 2][i])
dp[i] = chmin(dp[i],dp[i - 1] + a[i - 1][i])
print((dp[n - 1]))
| n = int(eval(input()))
h = list(map(int,input().split()))
INF = float('inf')
dp = [INF] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
def chmin(a, b):
if a <= b:
return a
else:
return b
for i in range(2, n):
dp[i] = chmin(dp[i], dp[i - 2] + abs(h[i - 2] - h[i]))
dp[i] = chmin(dp[i], dp[i - 1] + abs(h[i - 1] - h[i]))
print((dp[n - 1]))
| p03160 |
# coding: utf-8
# Your code here!
N=int(eval(input()))
A=list(map(int,input().split()))
dp=[0]*N
dp[1]=abs(A[1]-A[0])
for i in range(2,N):
dp[i]=min((dp[i-2]+abs(A[i]-A[i-2])),dp[i-1]+abs(A[i]-A[i-1]))
print((dp[-1]))
| # coding: utf-8
# Your code here!
N=int(eval(input()))
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-1]+abs(H[i]-H[i-1]),dp[i-2]+abs(H[i]-H[i-2]))
print((dp[-1])) | p03160 |
N = int(eval(input()))
h = list(map(int, input().split()))
INF = 1000 * 1000 * 1000
dp = [INF] * N
def absoluteDiff(a, b):
if a > b:
return a - b
else:
return b - a
dp[0] = 0
dp[1] = absoluteDiff(h[0], h[1])
for i in range(0, N - 2):
dp[i + 1] = min(dp[i + 1], dp[i] + absoluteDiff(h[i], h[i + 1]))
dp[i + 2] = dp[i] + absoluteDiff(h[i], h[i + 2])
dp[N - 1] = min(dp[N - 1], dp[N - 2] + absoluteDiff(h[N - 2], h[N - 1]))
print((str(dp[N - 1])))
| INF=int('fffFFFFffffFFFF',16)
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[INF] * n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min(abs(h[i]-h[i-1])+dp[i-1],abs(h[i]-h[i-2])+dp[i-2])
print((dp[n-1])) | p03160 |
n = int(eval(input()))
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 - k] + abs(h[i]-h[i-k]) for k in [1, 2])
print((dp[-1])) | n = int(eval(input()))
H = list(map(int, input().split()))
dp = [10 ** 12] * (n)
dp[0] = 0
dp[1] = abs(H[1] - H[0])
for i in range(1, n-1):
dp[i+1] = min(dp[i] + abs(H[i+1] - H[i]), dp[i-1] + abs(H[i+1] - H[i-1]))
ans = dp[n-1]
print(ans) | p03160 |
def retMin(a,b):
if a >= b:
return b
else:
return a
n=int(eval(input()))
r=list(map(int,input().split()))
dpList = [99999999999] * (n)
dpList[0] = 0
for i in range(1,n):
if i<2:
dpList[i] = retMin(dpList[i],dpList[i-1]+(abs(r[i]-r[i-1])))
else:
dpList[i] = retMin(dpList[i-1]+(abs(r[i]-r[i-1])),dpList[i-2]+(abs(r[i]-r[i-2])))
print((dpList[n-1])) | def retMin(a,b):
if a >= b:
return b
else:
return a
n=int(eval(input()))
r=list(map(int,input().split()))
dpList = [99999999999] * (n)
dpList[0] = 0
dpList[1] = dpList[0]+(abs(r[1]-r[0]))
for i in range(2,n):
dpList[i] = retMin(dpList[i-1]+(abs(r[i]-r[i-1])),dpList[i-2]+(abs(r[i]-r[i-2])))
print((dpList[n-1])) | p03160 |
def helper(h, n):
res = [0]*n
res[0] = 0
res[1] = abs(h[1]-h[0])
for i in range(2, n):
res[i] = min(res[i-1]+abs(h[i]-h[i-1]), res[i-2]+abs(h[i]-h[i-2]))
return res[-1]
def main():
n = int(eval(input()))
h = list(map(int, input().split(" ")))
print((helper(h, n)))
if __name__ == "__main__":
main() | def helper(h, n):
prev = 0
curr = abs(h[1]-h[0])
for i in range(2, n):
next = min(curr+abs(h[i]-h[i-1]), prev+abs(h[i]-h[i-2]))
prev = curr
curr = next
return curr
def main():
n = int(eval(input()))
h = list(map(int, input().split(" ")))
print((helper(h, n)))
if __name__ == "__main__":
main() | p03160 |
n = int(eval(input()))
h = [int(i) for i in input().split()]
dp = [0 for i in range(n)]
for i in range(n):
if i==0:
dp[i] = 0
elif i==1:
dp[i] = abs(h[i]-h[i-1])
else:
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]))
print((dp[n-1])) | N = int(eval(input()))
H = list(map(int, input().split()))
H = [0] + H
dp = [0] * (N+1)
for i in range(2,N+1):
if i-2>=1:
dp[i] = min(dp[i-1]+abs(H[i]-H[i-1]), dp[i-2]+abs(H[i]-H[i-2]))
else:
dp[i] = dp[i] + abs(H[i]-H[i-1])
res = dp[N]
print(res) | p03160 |
N = int(eval(input()))
H = list(map(int, input().split()))
for _ in range(10):
H.append(10**9)
dp = [10**9] * (N+2)
dp[0] = 0
# 配る方式
for i in range(N):
dp[i+1] = min(dp[i] + abs(H[i]-H[i+1]),dp[i+1])
dp[i+2] = min(dp[i] + abs(H[i]-H[i+2]), dp[i+2])
print((dp[N-1]))
| N = int(eval(input()))
H = list(map(int, input().split()))
for _ in range(10):
H.append(10**9)
dp = [10**9] * (N+2)
dp[0] = 0
# 引っ張ってくる方式
for i in range(1, N):
dp[i] = min(dp[i-1]+abs(H[i]-H[i-1]), dp[i-2]+abs(H[i]-H[i-2]))
print((dp[N-1]))
| p03160 |
n = int(eval(input()))
a = list(map(int, input().split()))
dp = [10**9+1]*n
dp[0] = 0
dp[1] = dp[0] + abs(a[1]-a[0])
for i in range(2, n):
dp[i] = min([dp[i-1]+abs(a[i]-a[i-1]), dp[i-2]+abs(a[i]-a[i-2])])
print((dp[n-1])) | n = int(eval(input()))
dp = [0]*(n+1)
a = list(map(int, input().split()))
dp[1] = abs(a[1]-a[0])
for i in range(2,n):
dp[i] = min(dp[i-2]+abs(a[i]-a[i-2]), dp[i-1]+abs(a[i]-a[i-1]))
print((dp[n-1])) | p03160 |
from sys import stdin,stdout,setrecursionlimit
from collections import Counter as C
setrecursionlimit(10**6)
M = 1000000007
input = stdin.readline
def write(n,sep="\n"):
stdout.write(str(n))
stdout.write(sep)
def gil():
return list(map(int, input().split()))
n = int(eval(input()))
h = gil()
CM = 1e18
def rp(i, h, n, c, p):
global CM
if i >= n:
ans = c + abs(p - h[n-1])
CM = min(ans, CM)
return ans
x = abs(p - h[i])
if c+x >= CM:
return 1e18
return min(rp(i+1, h, n, c + x, h[i]),rp(i+2, h, n, c + x, h[i]))
ans = min(rp(1, h, len(h), 0, h[0]),rp(2, h, len(h), 0, h[0]))
print(ans)
| from sys import stdin,stdout,setrecursionlimit
from collections import Counter as C
setrecursionlimit(10**6)
M = 1000000007
input = stdin.readline
def write(n,sep="\n"):
stdout.write(str(n))
stdout.write(sep)
def gil():
return list(map(int, input().split()))
n = int(eval(input()))
h = gil()
dp = [1e18]*(n+1)
dp[0] = 0
for i in range(n):
for j in [i+1, i+2]:
if j < n:
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]))
print((dp[n-1]))
| p03160 |
a = int(eval(input()))
hs = [int(x) for x in input().split()]
if a == 1:
print((0))
exit()
dp = [0]* len(hs)
dp[0] = 0
dp[1] = abs(hs[1] - hs[0])
for i in range(2, a):
dp[i] = min(abs(hs[i-1]- hs[i]) + dp[i-1], abs(hs[i-2]- hs[i]) + dp[i-2] )
print((dp[-1])) | a = int(eval(input()))
hs = [int(x) for x in input().split()]
dp = [0]* len(hs)
dp[0] = 0
dp[1] = abs(hs[1] - hs[0])
for i in range(2, a):
dp[i] = min(abs(hs[i-1]- hs[i]) + dp[i-1], abs(hs[i-2]- hs[i]) + dp[i-2] )
print((dp[-1])) | p03160 |
N = int(eval(input()))
C = list(map(int,input().split()))
dp = [-1 for _ in range(N)]
dp[0] = 0
dp[1] = abs(C[0] - C[1])
for i in range(0,N-2):
dp[i+2] = min(dp[i] + abs(C[i+2]-C[i]) , dp[i+1] + abs(C[i+2] - C[i+1]))
print((dp[N-1]))
| N = int(eval(input()))
H = list(map(int,input().split()))
DP = [0 for _ in range(N)]
DP[1] = abs(H[1]-H[0])
if len(H) > 2:
for i in range(2,N):
DP[i] = min(DP[i-2]+abs(H[i]-H[i-2]),DP[i-1]+abs(H[i]-H[i-1]))
print((DP[N-1])) | p03160 |
def func():
N = int(eval(input()))
H = [int(i) for i in input().split()]
dp = [0]*N
for i in range(1, N):
L = []
for j in range(max(0, i-2), i):
L.append(dp[j] + abs(H[i] - H[j]))
dp[i] = min(L)
print((dp[-1]))
if __name__=="__main__":
func() | N = int(eval(input()))
H = [int(i) for i in input().split()]
dp = [0] * N
dp[1] = abs(H[1] - H[0])
for i in range(2, N):
dp[i] = min(dp[i-2] + abs(H[i] - H[i-2]), dp[i-1] + abs(H[i] - H[i-1]))
print((dp[-1])) | p03160 |
import math
N = int(eval(input()))
h = list(map(int, input().split()))
dp = [float('INF')] * (10**5 + 10)
def chmin(a, b):
if a >= b:
return b
else:
return a
dp[0] = 0 #初期値 = 0
for i in range(N-1):
dp[i+1] = chmin(dp[i+1], dp[i] + abs(h[i+1] - h[i]))
if i < N-2:
dp[i+2] = chmin(dp[i+2], dp[i] + abs(h[i+2] - h[i]))
print((dp[N-1])) | import math
N = int(eval(input()))
h = list(map(int, input().split()))
dp = [float('INF')] * N
def chmin(a, b):
if a >= b:
return b
else:
return a
#初期値
dp[0] = 0
#Loop
for i in range(1, N):
dp[i] = chmin(dp[i], dp[i-1] + abs(h[i] - h[i-1]))
if i > 1:
dp[i] = chmin(dp[i], dp[i-2] + abs(h[i] - h[i-2]))
print((dp[-1])) | p03160 |
n = int(eval(input()))
h = [int(i) for i in input().split()]
m = [0, abs(h[0]-h[1])]
for i in range(2, n):
v = min(m[0]+abs(h[i-2]-h[i]), m[1]+abs(h[i-1]-h[i]))
m = [m[1], v]
print((m[1])) | n = int(eval(input()))
h = tuple(int(i) for i in input().split())
x, y = 0, abs(h[0]-h[1])
for i in range(2, n):
v = min(x+abs(h[i-2]-h[i]), y+abs(h[i-1]-h[i]))
x, y = y, v
print(y) | p03160 |
n = int(eval(input()))
h = tuple(int(i) for i in input().split())
x, y = 0, abs(h[0]-h[1])
for i in range(2, n):
v = min(x+abs(h[i-2]-h[i]), y+abs(h[i-1]-h[i]))
x, y = y, v
print(y) | n = int(eval(input()))
h = tuple(map(int, input().split()))
x, y = 0, abs(h[0]-h[1])
for i in range(2, n):
d1 = x+abs(h[i-2]-h[i])
d2 = y+abs(h[i-1]-h[i])
x, y = y, d1 if d1 < d2 else d2
print(y) | p03160 |
# -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
h_list = list(map(int, input().split()))
dp = [0]
for i in range(n):
dp.append(9999999999)
if i > 0:
dp[i] = min(dp[i], dp[i - 1] + abs(h_list[i] - h_list[i - 1]))
if i > 1:
dp[i] = min(dp[i], dp[i - 2] + abs(h_list[i] - h_list[i - 2]))
print((dp[-2]))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
h_list = list(map(int, input().split()))
dp = [0] + [9999999999] * (n - 1)
for i in range(n):
if i > 0:
dp[i] = min(dp[i], dp[i - 1] + abs(h_list[i] - h_list[i - 1]))
if i > 1:
dp[i] = min(dp[i], dp[i - 2] + abs(h_list[i] - h_list[i - 2]))
print((dp[-1]))
if __name__ == '__main__':
main()
| p03160 |
N = int(eval(input()))
H = list(map(int, input().split()))
H.append(0)
H.append(0)
#dp[足場i]=足場iにたどり着く最小コスト
dp = [10**10 for _ in range(N+10)]
dp[0] = 0
for i in range(N):
dp[i+1] = min(dp[i+1], dp[i] + abs(H[i]-H[i+1]))
dp[i+2] = min(dp[i+2], dp[i] + abs(H[i]-H[i+2]))
print((dp[N-1]))
| N = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * (N)
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
dp[i] = dp[i-1] + abs(h[i] - h[i-1])
dp[i] = min(dp[i], dp[i-2] + abs(h[i] - h[i-2]))
print((dp[N-1]))
| p03160 |
import itertools
n = int(eval(input()))
h = list(map(int, input().split()))
combi = []
perm = []
# 1からn桁の[1, 2]の数字の組み合わせのうち合計値がnになるものをcombiに代入
for i in range(int(n / 2), n + 1):
tmp_combi = list(itertools.combinations_with_replacement([1, 2], i))
for c in (tmp_combi):
if sum(c) == n:
combi.append(c)
# combiの順列を作成しpermに入れる
# setを使いユニークにしている
# 1, 1, 2 -> 1 1 2, 1 2 1, 2 1 1
for c in combi:
for p in list(set(list(itertools.permutations(c)))):
perm.append(p)
# 順列1つずつに対しコストを計算して最小値をmin_costに代入
min_cost = 10 ** 10
for p in perm:
cost = 0
p = list(p)
pos = p.pop(0)
if pos != 1:
continue
for j in p:
cost += abs(h[pos - 1] - h[pos + j - 1])
pos += j
if cost < min_cost:
min_cost = cost
print(min_cost) | N = int(eval(input()))
blank = 2
h = list(map(int,input().split())) + [0] * blank
INF = 10 ** 9 + 1
dp = [INF] * (N + blank)
dp[0] = 0
for i in range(N):
dp[i + 1] = min(dp[i] + abs(h[i + 1] - h[i]), dp[i + 1])
dp[i + 2] = min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 2])
print((dp[N - 1])) | p03160 |
n = int(eval(input()))
hlis = list(map(int, input().split()))
hlis.append(float('inf'))
dp = [0] + [abs(hlis[0] - hlis[1])] + [float('inf')]*(n-1)
for i in range(n-1):
one = abs(hlis[i]-hlis[i+1])
two = abs(hlis[i]-hlis[i+2])
dp[i+1] = min(dp[i]+one, dp[i+1])
dp[i+2] = min(dp[i]+two, dp[i+2])
print((dp[n-1])) | N = int(eval(input()))
hlis = list(map(int, input().split()))
dp = [-1]*N
dp[0] = 0
dp[1] = abs(hlis[0] - hlis[1])
for i in range(2, N):
dp[i] = min(dp[i-1]+abs(hlis[i]-hlis[i-1]), dp[i-2]+abs(hlis[i]-hlis[i-2]))
print((dp[-1])) | p03160 |
n=int(eval(input()))
numbers = [int(n) for n in input().split()]
cost = []
for i in range(0,n):
cost.append(0)
#cost[0]=0
cost[1]=abs(numbers[1]-numbers[0])
for i in range(2,n):
cost[i]=min((cost[i-2]+abs(numbers[i]-numbers[i-2])),(cost[i-1]+abs(numbers[i]-numbers[i-1])))
#print(cost)
print((cost[n-1])) | n=int(eval(input()))
h=list(map(int,input().split()))
dp=[0]*(n+1)
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min(dp[i-2]+abs(h[i]-h[i-2]),dp[i-1]+abs(h[i]-h[i-1]))
# print(dp)
print((dp[-2]))
| p03160 |
n = int(eval(input()))
h = list(map(int,input().split()))
dp = [0]*n
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(1,n-1):
dp[i+1] = min(dp[i-1]+abs(h[i+1]-h[i-1]),dp[i]+abs(h[i+1]-h[i]))
print((dp[-1])) | n = int(eval(input()))
h = list(map(int,input().split()))
dp = [0]*(n)
for i in range(1,n):
if i>1:
dp[i] = min(dp[i-1] + abs(h[i]-h[i-1]), dp[i-2] + abs(h[i]-h[i-2]))
else:
dp[i] = dp[i-1] + abs(h[i]-h[i-1])
print((dp[-1])) | p03160 |
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[float('inf')]*n
dp[0]=0#初期条件を設定
for i in range(1,n):
dp[i]=min(dp[i],dp[i-1]+abs(h[i]-h[i-1]))
#i=1の時i-2<0となるので先にここを計算する
if i>=2:
dp[i]=min(dp[i],dp[i-2]+abs(h[i]-h[i-2]))
print((dp[-1])) | #DP-A
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[float('inf')]*n
dp[0]=0
for i in range(1,n):
#2パターンの遷移を考え小さいほうを保存する
dp[i]=dp[i-1]+abs(h[i]-h[i-1])
if i>1:
dp[i]=min(dp[i],dp[i-2]+abs(h[i]-h[i-2]))
print((dp[-1])) | p03160 |
N = int(eval(input()))
H = [int(c) for c in input().split()]
prv1 = prv2 = cur = 0
for i in range(1, N):
j1 = abs(H[i] - H[i-1])
cur = min(j1 + prv1, abs(H[i] - H[i-2]) + prv2) if i > 1 else j1
prv2 = prv1
prv1 = cur
print(cur)
| N = int(eval(input()))
H = [int(c) for c in input().split()]
cur = abs(H[1] - H[0])
prv1 = cur
prv2 = 0
for i in range(2, N):
cur = min(abs(H[i] - H[i-1]) + prv1, abs(H[i] - H[i-2]) + prv2)
prv2 = prv1
prv1 = cur
print(cur)
| p03160 |
N = int(eval(input()))
h_list = input().split()
h_list = [int(i) for i in h_list]
current_V = [0]
current_value = [0] * N
current_cost = 0
while (current_V != []):
V = current_V.pop(0)
if N - 1 >= V + 1 :
if V + 1 not in current_V :
current_V.append(V + 1)
current_value[V + 1] = current_value[V] + abs(h_list[V] - h_list[V + 1])
else:
value = current_value[V] + abs(h_list[V] - h_list[V + 1])
if value < current_value[V + 1]:
current_value[V + 1] = value
if N - 1 >= V + 2 :
if V + 2 not in current_V :
current_V.append(V + 2)
current_value[V + 2] = current_value[V] + abs(h_list[V] - h_list[V + 2])
else:
value = current_value[V] + abs(h_list[V] - h_list[V + 2])
if value < current_value[V + 2]:
current_value[V + 2] = value
print((current_value[N - 1]))
| N = int(eval(input()))
h_list = input().split()
h_list = [int(i) for i in h_list]
current_V = [0]
current_value = [0] * N
current_value[1]=abs(h_list[0]-h_list[1])
for i in range(2,N) :
current_value[i]=min(current_value[i-1]+abs(h_list[i-1]-h_list[i]),current_value[i-2]+abs(h_list[i-2]-h_list[i]))
print((current_value[-1])) | p03160 |
n=int(eval(input()))
h=list(map(int, input().split()))
dp=[0]*n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]))
print((dp[-1])) | n=int(eval(input()))
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(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]))
print((dp[-1])) | p03160 |
def 解():
N = int(eval(input()))
aH = [int(_) for _ in input().split()]
#dp = [0]*3
#dp[1] = abs(aH[0] - aH[1])
dp={0:0,1:abs(aH[0]-aH[1]),2:0}
for i in range(2,N):
dp[i%3] = min(abs(aH[i]-aH[i-1])+dp[(i-1)%3],abs(aH[i]-aH[i-2]) + dp[(i-2)%3])
print((dp[(N-1)%3]))
解()
| def 解():
N = int(eval(input()))
aH = [int(_) for _ in input().split()]
dp = [0]*3
dp[1] = abs(aH[0] - aH[1])
#dp={0:0,1:abs(aH[0]-aH[1]),2:0}
for i in range(2,N):
dp[i%3] = min(abs(aH[i]-aH[i-1])+dp[(i-1)%3],abs(aH[i]-aH[i-2]) + dp[(i-2)%3])
print((dp[(N-1)%3]))
解()
| p03160 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 10
n = int(eval(input()))
# 貰うDPだと0へのアクセスが、配るDPだとn+1へのアクセスが必要になる
h = [INF] + list(map(int, input().split())) + [INF]
dp = [INF] + [INF] * n + [INF]
dp[1] = 0
def chmin(dp_table, index, value):
if dp_table[index] > value:
dp_table[index] = value
# 貰うDP(dp[i-1], dp[i-2]が計算済み)
#for i in range(2, n+1):
# chmin(dp, i, dp[i-1] + abs(h[i] - h[i-1]))
# chmin(dp, i, dp[i-2] + abs(h[i] - h[i-2]))
# 配るDB(dp[i]が計算済み)
#for i in range(1, (n-1)+1):
# chmin(dp, i+1, dp[i] + abs(h[i] - h[i+1]))
# chmin(dp, i+2, dp[i] + abs(h[i] - h[i+2]))
#
#print(dp[n])
# 再帰(DFS) (メモ化なし)
def dfs(i):
if i == 0:
return INF
if i == 1:
return 0
ans = INF
prev_cost = dfs(i-1)
if ans > prev_cost + abs(h[i] - h[i-1]):
ans = prev_cost + abs(h[i] - h[i-1])
prev_cost = dfs(i-2)
if ans > prev_cost + abs(h[i] - h[i-2]):
ans = prev_cost + abs(h[i] - h[i-2])
return ans
# 再帰(DFS) (メモ化ありfunctools.lru_cache使用)
import functools
dfs = functools.lru_cache(maxsize=None)(dfs)
print((dfs(n)))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 10
n = int(eval(input()))
# 貰うDPだと0へのアクセスが、配るDPだとn+1へのアクセスが必要になる
h = [INF] + list(map(int, input().split())) + [INF]
dp = [INF] + [INF] * n + [INF]
dp[1] = 0
def chmin(dp_table, index, value):
if dp_table[index] > value:
dp_table[index] = value
# 再帰(DFS) (メモ化あり: テーブル使用)
def dfs(i):
if i == 0:
return INF
if i == 1:
return 0
if dp[i] != INF:
return dp[i]
ans = INF
prev_cost = dfs(i-1)
if ans > prev_cost + abs(h[i] - h[i-1]):
ans = prev_cost + abs(h[i] - h[i-1])
prev_cost = dfs(i-2)
if ans > prev_cost + abs(h[i] - h[i-2]):
ans = prev_cost + abs(h[i] - h[i-2])
dp[i] = ans
return dp[i]
print((dfs(n)))
| p03160 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 10
n = int(eval(input()))
# 貰うDPだと0へのアクセスが、配るDPだとn+1へのアクセスが必要になる
h = [INF] + list(map(int, input().split())) + [INF]
dp = [INF] + [INF] * n + [INF]
dp[1] = 0
def chmin(dp_table, index, value):
if dp_table[index] > value:
dp_table[index] = value
# 再帰(DFS) (メモ化あり: テーブル使用)
def dfs(i):
if i == 0:
return INF
if i == 1:
return 0
if dp[i] != INF:
return dp[i]
ans = INF
prev_cost = dfs(i-1)
if ans > prev_cost + abs(h[i] - h[i-1]):
ans = prev_cost + abs(h[i] - h[i-1])
prev_cost = dfs(i-2)
if ans > prev_cost + abs(h[i] - h[i-2]):
ans = prev_cost + abs(h[i] - h[i-2])
dp[i] = ans
return dp[i]
print((dfs(n)))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
n = int(eval(input()))
h = [INF] + list(map(int, input().split())) + [INF]
dp = [INF] + [INF] * n + [INF]
dp[1] = 0
for i in range(1, n):
dp[i+1] = min(dp[i+1], dp[i] + abs(h[i+1] - h[i]))
dp[i+2] = min(dp[i+2], dp[i] + abs(h[i+2] - h[i]))
print((dp[n]))
| p03160 |
import sys
sys.setrecursionlimit(1000000)
# 入力
N = int(eval(input()))
H = [int(i) for i in input().split()]
# メモ用のDPテーブルを生成
dp = [float("inf") for i in range(N)]
# 足場iにたどり着く最初コストを返す
def rec(i):
# ベースケースをセット
if i == 0:
return 0
# メモをチェック
if dp[i] < float("inf"):
return dp[i]
# i-1から遷移する場合
cost = rec(i-1) + abs(H[i] - H[i-1])
# i-2から遷移する場合
if i > 1:
cost = min(cost, rec(i-2) + abs(H[i] - H[i-2]))
# 結果をメモしてから返す
dp[i] = cost
return cost
print((rec(N-1))) | N = int(eval(input()))
H = [int(i) for i in input().split()]
dp = [float("inf")] * N
dp[0], dp[1] = 0, abs(H[1]-H[0])
for i in range(2, N):
dp[i] = min(dp[i], dp[i-1]+abs(H[i]-H[i-1]), dp[i-2]+abs(H[i]-H[i-2]))
print((dp[N-1])) | p03160 |
n = int(eval(input()))
h = list(map(int,input().split()))
inf = 10 ** 10
dp = [inf] * n
dp[0] = 0
for i in range(n - 1):
temp = abs(h[i + 1] - h[i])
dp[i + 1] = min(dp[i + 1], temp + dp[i])
if i + 2 < n:
temp = abs(h[i + 2] - h[i])
dp[i + 2] = min(dp[i + 2], temp + dp[i])
print((dp[-1])) | N = int(eval(input()))
h = [int(i) for i in input().split()]
dp = [10**10 for _ in range(N)]
dp[0] = 0
for i in range(N-1):
dp[i+1] = min(dp[i+1], dp[i] + abs(h[i+1]-h[i]))
if i+2 < N:
dp[i+2] = min(dp[i+2], dp[i] + abs(h[i+2]-h[i]))
print((dp[-1])) | p03160 |
N = int(eval(input()))
h = list(map(int, input().split()))
INF = 10**9
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[i-1] + abs(h[i] - h[i-1]), dp[i])
if i + 1 < N:
dp[i+1] = min(dp[i-1] + abs(h[i+1] - h[i-1]) , dp[i+1])
print((dp[N-1])) | N = int(eval(input()))
h = list(map(int, input().split()))
INF = 10**9
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[i], dp[i-1]+abs(h[i] - h[i-1]))
if i > 1:
dp[i] = min(dp[i], dp[i-2]+abs(h[i] - h[i-2]))
print((dp[N-1])) | p03160 |
from sys import stdin as I
from sys import stdout as O
N = int(I.readline())
H = [None] + list(map(int,I.readline().split()))
DP = [None for i in range(N+1)]
DP[1] = 0
DP[2] = abs(H[2]-H[1])
for i in range(3,N+1):DP[i] = min(DP[i-2]+abs(H[i]-H[i-2]),DP[i-1]+abs(H[i]-H[i-1]))
print((DP[N])) | N = int(eval(input()))
h = [*list(map(int, input().split()))]
dp = [0, abs(h[1] - h[0])] + [0] * (N - 2)
for i in range(2, N):
dp[i] = min(abs(h[i] - h[i-1]) + dp[i-1],abs(h[i] - h[i-2]) + dp[i-2])
print((dp[N-1])) | p03160 |
n = int(eval(input()))
H = list(map(int, input().split()))
cost = [None]*n
h1 = [None]*(n-1)
h2 = [None]*(n-2)
one_ago = H[1]
two_ago = H[0]
h1[0] = abs(two_ago-one_ago)
for i in range(2, n):
new = H[i]
h1[i-1] = abs(one_ago-new)
h2[i-2] = abs(two_ago-new)
two_ago, one_ago = one_ago, new
cost[0], cost[1] = 0, h1[0]
for i in range(2, n):
cost[i] = min(cost[i-2]+h2[i-2], cost[i-1]+h1[i-1])
print((cost[n-1])) | n = int(eval(input()))
h = list(map(int, input().split()))
dp = [None]*n
dp[0], dp[1] = 0, abs(h[0]-h[1])
for i in range(2, n):
dp[i] = min(dp[i-1]+abs(h[i-1]-h[i]), dp[i-2]+abs(h[i-2]-h[i]))
print((dp[-1])) | p03160 |
# coding: utf-8
# Your code here!
import math
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[math.inf for _ in range(n)]
dp[0]=0
for i in range(1,n):
if i==1:
dp[i]=dp[i-1]+abs(h[i]-h[i-1])
else:
dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
print((dp[n-1])) |
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[0 for i in range(n)]
for i in range(1,n):
if i==1:
dp[i]=dp[i-1]+abs(h[i]-h[i-1])
else:
dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
print((dp[n-1])) | p03160 |
n = int(eval(input()))
h = list(map(int, input().split()))
dp = [0, abs(h[1] - h[0])]
for i in range(2, n):
dp.append(min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2])))
print((dp[n - 1]))
| def input_li():
return list(map(int, input().split()))
def input_int():
return int(eval(input()))
N = input_int()
h_li = input_li()
dp = [0] * N
dp[0] = 0
dp[1] = abs(h_li[1] - h_li[0])
for i in range(2, N):
dp[i] = min(
dp[i - 1] + abs(h_li[i] - h_li[i - 1]),
dp[i - 2] + abs(h_li[i] - h_li[i - 2])
)
print((dp[-1]))
| p03160 |
import sys
sys.setrecursionlimit(1000000)
def input_from_console():
n = int(input().strip())
h_list = list(map(int, input().split()))
return n, h_list
def solve(n, h_list):
dp = [-1] * (n+2)
dp[0] = 0
dp[1] = abs(h_list[1]- h_list[0])
def dp_solve(i):
if dp[i] != -1:
return dp[i]
dp[i] = min(
dp_solve(i-1) + abs(h_list[i] - h_list[i-1]),
dp_solve(i-2) + abs(h_list[i] - h_list[i-2]),
)
return dp[i]
return dp_solve(n-1)
def main():
n, h_list = input_from_console()
print((solve(n, h_list)))
if __name__ == "__main__":
import sys
if sys.gettrace(): # Check if the python interpreter is in debug mode or not.
check_cases()
else:
main()
| def input_from_console():
n = int(input().strip())
h_list = list(map(int, input().split()))
return n, h_list
def solve(n, h_list):
import sys
sys.setrecursionlimit(200000)
dp = [-1] * (n + 2)
dp[0] = 0
dp[1] = abs(h_list[1] - h_list[0])
def recursive_dp_sover(i):
if dp[i] != -1:
return dp[i]
dp[i] = min(
recursive_dp_sover(i - 1) + abs(h_list[i] - h_list[i - 1]),
recursive_dp_sover(i - 2) + abs(h_list[i] - h_list[i - 2])
)
return dp[i]
return recursive_dp_sover(n - 1)
def main():
n, h_list = input_from_console()
print((solve(n, h_list)))
if __name__ == "__main__":
import sys
if sys.gettrace(): # Check if the python interpreter is in debug mode or not.
check_cases()
else:
main() | p03160 |
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[float('inf')]*n
dp[0],dp[1]=0,abs(h[1]-h[0])
for i in range(2,n):
pre1=abs(h[i]-h[i-1])+dp[i-1]
pre2=abs(h[i]-h[i-2])+dp[i-2]
dp[i]=min(pre1,pre2)
print((dp[-1])) | n=int(eval(input()))
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):
dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
print((dp[-1])) | p03160 |
import sys
sys.setrecursionlimit(100000)
input=lambda : sys.stdin.readline().rstrip('\n')
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[10**18 for i in range(n)]
def cost(n):
if n==0:
return 0
if n<0:
return 10**18
if dp[n]!=10**18:
return dp[n]
return min(cost(n-1)+abs(h[n]-h[n-1]),cost(n-2)+abs(h[n]-h[n-2]))
print((cost(n-1)))
| import sys
sys.setrecursionlimit(100000)
input=lambda : sys.stdin.readline().rstrip('\n')
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[10**18 for i in range(n)]
def cost(n):
if n==0:
return 0
if n<0:
return 10**18
if dp[n]!=10**18:
return dp[n]
dp[n] = min(cost(n-1)+abs(h[n]-h[n-1]),cost(n-2)+abs(h[n]-h[n-2]))
return dp[n]
print((cost(n-1)))
| p03160 |
import sys
sys.setrecursionlimit(100000)
input=lambda : sys.stdin.readline().rstrip('\n')
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[10**18 for i in range(n)]
def cost(n):
if n==0:
return 0
if n<0:
return 10**18
if dp[n]!=10**18:
return dp[n]
dp[n] = min(cost(n-1)+abs(h[n]-h[n-1]),cost(n-2)+abs(h[n]-h[n-2]))
return dp[n]
print((cost(n-1)))
| import sys
sys.setrecursionlimit(2000000000)
input=lambda : sys.stdin.readline().rstrip('\n')
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[10**18 for i in range(n)]
def cost(n):
if n==0:
return 0
if n<0:
return 10**18
if dp[n]!=10**18:
return dp[n]
dp[n] = min(cost(n-1)+abs(h[n]-h[n-1]),cost(n-2)+abs(h[n]-h[n-2]))
return dp[n]
print((cost(n-1)))
| p03160 |
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[0]
res=0
for i in range(1,n):
if i>1:
if (abs(h[i]-h[i-1])+dp[i-1])>(abs(h[i]-h[i-2])+dp[i-2]):
dp.append(abs(h[i]-h[i-2])+dp[i-2])
else:
dp.append(abs(h[i]-h[i-1])+dp[i-1])
else:
dp.append(abs(h[i]-h[i-1]))
res=dp[i]
print(res) | n=int(eval(input()))
h=list(map(int,input().split()))
dp=[0]*n
dp[1]=abs(h[1]-h[0])
if n>2:
for i in range(2,n):
dp[i]=min(abs(h[i]-h[i-1])+dp[i-1],abs(h[i]-h[i-2])+dp[i-2])
print((dp[n-1])) | p03160 |
n = int(eval(input()))
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-2] + abs(h[i] - h[i-2]), dp[i-1] + abs(h[i] - h[i-1]))
print((dp[n-1])) | N = int(eval(input()))
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(abs(h[i]-h[i-1])+dp[i-1], abs(h[i]-h[i-2])+dp[i-2])
print((dp[-1])) | p03160 |
import math
N = int(eval(input()))
h = list(map(int, input().split()))
h += [math.inf, math.inf]
dp = list([math.inf for i in range(N + 2)]) # dpテーブル
dp[0] = 0
for i in range(N):
if dp[i + 1] > (dp[i] + abs(h[i] - h[i + 1])):
dp[i + 1] = (dp[i] + abs(h[i] - h[i + 1]))
else:
dp[i + 1] = dp[i + 1]
if dp[i + 2] > dp[i] + abs(h[i] - h[i + 2]):
dp[i + 2] = dp[i] + abs(h[i] - h[i + 2])
else:
dp[i + 2] = dp[i + 2]
print((dp[N - 1]))
|
def chmin(a, b): return b if a > b else a
def chmax(a, b): return a if a > b else b
"""もらうDP"""
import math
N = int(eval(input()))
h = list(map(int, input().split()))
dp = list([math.inf for i in range(N)]) # dpテーブル
dp[0] = 0
for i in range(N):
dp[i] = chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]))
if i > 1:
dp[i] = chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]))
print((dp[N-1]))
| p03160 |
N=int(eval(input()))
h=list(map(int,input().split()))
INF=10**9+1
dp=[INF]*(N)
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,len(h)):
dp[i]=min(dp[i-2]+abs(h[i]-h[i-2]),dp[i-1]+abs(h[i]-h[i-1]))
print((dp[N-1])) | import sys
readline = sys.stdin.readline
N = int(readline())
H = list(map(int,readline().split()))
INF = 10 ** 10
dp = [INF] * N
dp[0] = 0
dp[1] = abs(H[1] - H[0])
for i in range(2,len(dp)):
dp[i] = min(dp[i - 2] + abs(H[i] - H[i - 2]), dp[i - 1] + abs(H[i] - H[i - 1]))
print((dp[N - 1])) | p03160 |
# dp[i]: i+1にくるまでにかかったコストの最小値
N = int(eval(input()))
h = list(map(int, input().split()))
dp = [float("inf") for _ in range(N)]
dp[0] = 0
for i in range(N-1):
dp[i+1] = min(dp[i+1], dp[i]+abs(h[i]-h[i+1]))
if i < N-2:
dp[i+2] = min(dp[i+2], dp[i]+abs(h[i]-h[i+2]))
print((dp[-1])) | N = int(eval(input()))
h = list(map(int, input().split(" ")))
dp = [float("inf")]*(N)
dp[0] = 0
for i in range(N-1):
dp[i + 1] = min(dp[i + 1], abs(h[i + 1] - h[i]) + dp[i])
if i + 2 < N:
dp[i + 2] = min(dp[i + 2], abs(h[i + 2] - h[i]) + dp[i])
print((dp[-1])) | p03160 |
n,*h=list(map(int,open(0).read().split()))
a=[0]+[abs(h[1]-h[0])]+[10**8]*(n-2)
for i in range(2,n):
a[i]=min(a[i-1]+abs(h[i]-h[i-1]),a[i-2]+abs(h[i]-h[i-2]))
print((a[-1])) | n,*h=list(map(int,open(0).read().split()));a=[0]+[abs(h[1]-h[0])]+[0]*(n-2)
for i in range(2,n):
a[i]=min(a[i-1]+abs(h[i]-h[i-1]),a[i-2]+abs(h[i]-h[i-2]))
print((a[-1])) | p03160 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I()
l=LI()
dp=[0]*100010
dp[1]=0
dp[2]=abs(l[0]-l[1])
for i in range(2,n):
dp[i+1]=min(dp[i]+abs(l[i]-l[i-1]),dp[i-1]+abs(l[i]-l[i-2]))
return dp[n]
print((main()))
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I()
l=LI()
dp=[inf]*100010
dp[0]=0
dp[1]=0
dp[2]=abs(l[1]-l[0])
for i in range(2,n):
dp[i+1]=min(dp[i-1]+abs(l[i]-l[i-2]),dp[i]+abs(l[i]-l[i-1]))
return dp[n]
print((main()))
| p03160 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I()
l=LI()
dp=[0]*100010
dp[0]=0
dp[1]=abs(l[1]-l[0])
for i in range(2,n):
dp[i]=min(dp[i-2]+abs(l[i-2]-l[i]),dp[i-1]+abs(l[i-1]-l[i]))
return dp[n-1]
print((main()))
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
def LI(): return list(map(int,input().split()))
def I(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def main():
n=I()
l=LI()
dp=[inf]*100010
dp[0]=0
dp[1]=abs(l[0]-l[1])
for i in range(2,n):
dp[i]=min(dp[i-2]+abs(l[i-2]-l[i]),dp[i-1]+abs(l[i-1]-l[i]))
return dp[n-1]
print((main()))
| p03160 |
n=int(eval(input()))
h=list(map(int,input().split()))
dp=[0]*n
def dis(a,b):
return abs(h[a]-h[b])
dp[1]=dis(1,0)
for i in range(2,n):
dp[i]=min(dp[i-1]+dis(i,i-1),dp[i-2]+dis(i,i-2))
print((dp[-1])) | n=int(eval(input()))
h=list(map(int,input().split()))
dp=[10**7]*n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(n-2):
dp[i+2]=min(dp[i+1]+abs(h[i+2]-h[i+1]),dp[i]+abs(h[i+2]-h[i]))
print((dp[n-1])) | p03160 |
n = int(eval(input()))
h = list(map(int,input().split()))
dp = [0] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2,n):
dp[i] = min(dp[i-2] + abs(h[i-2] - h[i]), dp[i-1] + abs(h[i-1] - h[i]))
print((dp[n-1]))
| n = int(eval(input()))
pedras = list(map(int,input().split()))
dp = [0] * n
dp[0] = 0
dp[1] = abs(pedras[0] - pedras[1])
for i in range(2,n):
custo1 = dp[i-1] + abs(pedras[i-1] - pedras[i])
custo2 = dp[i-2] + abs(pedras[i-2] - pedras[i])
dp[i] = min(custo1,custo2)
print((dp[n-1]))
| p03160 |
N = int(eval(input()))
H = list(map(int,input().split()))
def main():
if N==2:
print((abs(H[1] - H[0])))
return
costs = [0 for _ in range(N)]
costs[1] = abs(H[1]-H[0])
costs[2] = min(costs[0]+abs(H[1]-H[0]), abs(H[2]-H[0]))
for i in range(2,N):
cost_1 = abs(H[i] - H[i-1]) # 1段上る
cost_2 = abs(H[i] - H[i-2]) # 2段上る
costs[i] = min(costs[i-1] + cost_1, costs[i-2] + cost_2)
print((costs[-1]))
if __name__ == "__main__":
main() | N = int(eval(input()))
H = list(map(int,input().split()))
def main():
if N==2:
print((abs(H[1] - H[0])))
return
costs = [0 for _ in range(N)]
costs[1] = abs(H[1]-H[0])
costs[2] = min(costs[0] + abs(H[1]-H[0]), abs(H[2]-H[0])) # 0>1>2と0>2のmin
for i in range(2,N):
step_1 = abs(H[i] - H[i-1]) # 1段上る
step_2 = abs(H[i] - H[i-2]) # 2段上る
# 漸化式 fn = min(fn-1, fn-2)
costs[i] = min(costs[i-1] + step_1, costs[i-2] + step_2)
print((costs[-1]))
if __name__ == "__main__":
main() | p03160 |
"""
arr = list(map(int, input().split()))
n,k=map(int, input().split())
"""
import math
import sys
# input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp():
return(int(eval(input())))
def inlt():
return(list(map(int,input().split())))
def insr():
s = eval(input())
return(list(s[:len(s) - 1]))
def invr():
return(list(map(int,input().split())))
length_path = int(eval(input()))
path = inlt()
dp = [float('inf')] * length_path
dp[0] = 0
for i in range(length_path):
for j in range(i+1, i + 2 + 1):
if j < length_path:
dp[j] = min(dp[j], dp[i] + abs(path[j] - path[i]))
print((dp[length_path - 1])) | """
arr = list(map(int, input().split()))
n,k=map(int, input().split())
"""
import math
import sys
# input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp(): #Reads integer input
return(int(eval(input())))
def inlt(): #Reads list of int
return(list(map(int,input().split())))
def insr():
s = eval(input())
return(list(s[:len(s) - 1]))
def invr(): #Reads numbers into separate var
return(list(map(int,input().split())))
n = int(eval(input()))
stones = inlt()
dp = [float('inf')] * n
dp[0] = 0
dp[1] = abs(stones[1] - stones[0])
for i in range(2, n):
dp[i] = min(dp[i-1] + abs(stones[i] - stones[i-1]), dp[i-2] + abs(stones[i] - stones[i-2]))
print((dp[n-1])) | p03160 |
n = int(eval(input()))
h = list(map(int, input().split()))
dp = [100000] * n
dp[0] = 0
for i in range(0, n):
if i == 0:
dp[i] = 0
elif i == 1:
dp[i] = abs(h[i-1] - h[i])
else:
a = dp[i-1] + abs(h[i] - h[i-1])
b = dp[i-2] + abs(h[i] - h[i-2])
dp[i] = min(dp[i-1] + abs(h[i] - h[i-1]), dp[i-2] + abs(h[i] - h[i-2]))
print((dp[-1]))
| n = int(eval(input()))
h = list(map(int, input().split()))
dp = [100000] * n
dp[0] = 0
for i in range(0, n):
if i == 0:
dp[i] = 0
elif i == 1:
dp[i] = abs(h[i-1] - h[i])
else:
dp[i] = min(dp[i-1] + abs(h[i] - h[i-1]), dp[i-2] + abs(h[i] - h[i-2]))
print((dp[-1]))
| p03160 |
N = int(eval(input()))
h = [int(i) for i in input().split()]
dp=[0 for i in range(N)]
dp[1] = abs(h[1] - h[0])
for i in range(N-2):
dp[i+2]=min(dp[i+1]+ abs(h[i+2]-h[i+1]), dp[i]+ abs(h[i+2]-h[i]))
print((dp[N-1]))
| N = int(eval(input()))
h = [int(i) for i in input().split()]
dp = [0]*N
dp[1] = abs(h[1] - h[0])
for i in range(N-2):
dp[i+2]=min(dp[i+1]+ abs(h[i+2]-h[i+1]), dp[i]+ abs(h[i+2]-h[i]))
print((dp[N-1])) | p03160 |
N = int(eval(input()))
h = list(map(int, input().split()))
dp = [float('inf')]*len(h)
dp[0] = 0
for i in range(N-1):
if i<N-2:
dp[i+2] = min(dp[i]+abs(h[i]-h[i+2]), dp[i+2])
dp[i+1] = min(dp[i]+abs(h[i]-h[i+1]), dp[i+1])
print((dp[-1])) | N = int(eval(input()))
h = list(map(int, input().split()))
dp = [float('inf') for _ in range(N)]
dp[0] = 0
dp[1] = dp[0]+abs(h[0]-h[1])
for i in range(2, N):
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]))
print((dp[-1])) | p03160 |
N = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * (N)
for i in range(N):
if i > 1:
dp[i] = min(dp[i-1] + abs(h[i] - h[i-1]), dp[i-2] + abs(h[i] - h[i-2]))
elif i == 1:
dp[i] = dp[i-1] + abs(h[i] - h[i-1])
print((dp[-1])) | N = int(eval(input()))
h = list(map(int, input().split()))
dp = [0] * (N)
for i in range(1, N):
if i > 1:
dp[i] = min(dp[i-1] + abs(h[i] - h[i-1]), dp[i-2] + abs(h[i] - h[i-2]))
else:
dp[i] = dp[i-1] + abs(h[i] - h[i-1])
print((dp[-1])) | p03160 |
N = int(eval(input()))
H = list(map(int,input().split()))
dp = [float('inf') for i in range(N)]
#全ノードを取り敢えずinfにしておく
dp[0] = 0
for i in range(N-1):
#足場を一個飛んだ時
dp[i+1] = min(dp[i+1],dp[i] + abs(H[i+1] - H[i]))
#足場を二個飛んだ時
if i <= N-3:
dp[i+2] = min(dp[i+2], dp[i] + abs(H[i + 2]-H[i]))
print((dp[N-1])) | N = int(eval(input()))
H =list(map(int,input().split()))
dp = [float('inf')]*N
#dp[i]は足場ｉにいくためのコストの最小値
dp[0] = 0
dp[1] = abs(H[1]-H[0])
for i in range(N-2):
for j in range(1,3):
dp[i+j] = min(dp[i]+abs(H[i]-H[i+j]),
dp[i+1]+abs(H[i+1]-H[i+j]))
print((dp[-1]))
| p03160 |
n = int(eval(input()))
h = list(map(int,input().split()))
if n == 2:
print((abs(h[0]-h[1])))
else:
lst = set([format(x,'b').zfill(n-2) + '1' for x in set(range((n-2) ** 2))])
del_lst = set()
for i in lst:
if '00' in i:
del_lst.add(i)
lst = list(lst - del_lst)
ans =[[h[0],0] for i in range(len(lst))]
for i in range(len(lst)):
k = 1
for j in lst[i]:
if j == '1':
ans[i][1] += abs(h[k] - ans[i][0])
ans[i][0] = h[k]
k += 1
print((min(ans)[1])) | n = int(eval(input()))
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[i-1]) + ans[i-1], abs(h[i] - h[i-2]) + ans[i-2])
print((ans[-1])) | p03160 |
n = int(eval(input()))
h = list(map(int, input().split()))
cost = [float('inf') for _ in range(n)]
cost[0] = 0
for x in range(n):
if x + 1 < n:
cost[x + 1] = min(cost[x + 1], cost[x] + abs(h[x + 1] - h[x]))
if x + 2 < n:
cost[x + 2] = min(cost[x + 2], cost[x] + abs(h[x + 2] - h[x]))
print((cost[n - 1]))
| n = int(eval(input()))
h = list(map(int, input().split()))
cost = [9999999999] * n
cost[0] = 0
for x in range(n):
if x + 1 < n:
cost[x + 1] = min(cost[x + 1], cost[x] + abs(h[x + 1] - h[x]))
if x + 2 < n:
cost[x + 2] = min(cost[x + 2], cost[x] + abs(h[x + 2] - h[x]))
print((cost[n - 1]))
| p03160 |
size = int(eval(input()))
arr = list(map(int, input().split()))
dp = [0]*(size)
dp[0] = 0
dp[1] = abs(arr[1] - arr[0])
for i in range(2,size):
dp[i] = min(dp[i-1] + abs(arr[i-1]-arr[i]), dp[i-2] + abs(arr[i-2]- arr[i]))
print((dp[size-1]))
| n = int(eval(input()))
arr = list(map(int, input().split()))
dp = [0 for i in range(n)]
sum = 0
dp[1] = abs(arr[1]-arr[0])
for i in range(2, len(arr)):
dp[i] = min(dp[i-1]+abs(arr[i]-arr[i-1]), dp[i-2]+abs(arr[i]-arr[i-2]))
print((dp[-1]))
| p03160 |
if __name__ == "__main__":
N = int(eval(input()))
h = [int(n) for n in input().split()]
dp = [0] * int(1e5) # dp[i]はiにたどり着くコストの最小値
# dp[0] = 0
# dp[n] = min(dp[n-1] + abs(h[n] - h[n-1]), dp[n-2] + |h[n] - h[n-2]|)
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
dp[i] = min(dp[i-1] + abs(h[i]-h[i-1]), dp[i-2] + abs(h[i]-h[i-2]))
print((dp[N-1]))
| def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
dp = [-1]*N
dp[0] = 0
dp[1] = abs(A[1] - A[0])
for i in range(2,N):
dp[i] = min(dp[i-1] + abs(A[i] - A[i-1]), dp[i-2] + abs(A[i] - A[i-2]))
print((dp[N-1]))
main() | p03160 |
"""
https://atcoder.jp/contests/dp/tasks/dp_a
"""
from copy import deepcopy
N = int(eval(input()))
arr = [int(i) for i in input().split(" ")]
def getMinSteps():
dp_2 = [0, ]
dp_1 = [abs(arr[1] - arr[0]), ]
total_cost = 0
i = 2
while i < N:
diff1 = abs(arr[i] - arr[i-1])
diff2 = abs(arr[i] - arr[i-2])
temp = deepcopy(dp_2)
dp_2 = deepcopy(dp_1)
for j in range(len(dp_1)):
dp_1[j] += diff1
for j in range(len(temp)):
dp_1.append(temp[j] + diff2)
i += 1
return min(dp_1)
print((getMinSteps())) | """
https://atcoder.jp/contests/dp/tasks/dp_a
"""
from copy import deepcopy
N = int(eval(input()))
arr = [int(i) for i in input().split(" ")]
def getMinSteps():
dp_2 = [0, ]
dp_1 = [abs(arr[1] - arr[0]), ]
total_cost = 0
i = 2
while i < N:
diff1 = abs(arr[i] - arr[i-1])
diff2 = abs(arr[i] - arr[i-2])
temp = deepcopy(dp_2)
dp_2 = deepcopy(dp_1)
for j in range(len(dp_1)):
dp_1[j] += diff1
for j in range(len(temp)):
dp_1.append(temp[j] + diff2)
dp_1 = sorted(dp_1)[0:2]
i += 1
return min(dp_1)
print((getMinSteps())) | p03160 |
n = int(eval(input()))
H = [int(i) for i in input().split()]
dp = [0] * n
dp[1] = abs(H[0] - H[1])
for i in range(2, n):
dp[i] = min(abs(H[i] - H[i - 1]) + dp[i - 1], abs(H[i] - H[i - 2]) + dp[i - 2])
print((dp[-1])) | n = int(eval(input()))
A = [int(i) for i in input().split()]
dp = [0] * n
dp[1] = abs(A[0] - A[1])
for i in range(2, n):
route1 = abs(A[i] - A[i-2]) + dp[i-2]
route2 = abs(A[i] - A[i-1]) + dp[i-1]
dp[i] = min(route1, route2)
print((dp[-1])) | p03160 |
import sys
sys.setrecursionlimit(100000)
N = int(input())
H = list(map(int, input().split()))
def sumOfCost(i):
if i == 0:
return 0
elif i == 1:
return sumOfCost(0)+abs(H[i]-H[0])
else:
c1 = sumOfCost(i-1)+abs(H[i]-H[i-1])
c2 = sumOfCost(i-2)+abs(H[i]-H[i-2])
return min(c1,c2)
print(sumOfCost(N-1))
| import sys
sys.setrecursionlimit(100000)
N = int(input())
H = list(map(int, input().split()))
cost = [-1]*N
def sumOfCost(i):
if cost[i] >= 0:
return cost[i]
if i == 0:
soc=0
elif i == 1:
soc= sumOfCost(0)+abs(H[i]-H[0])
else:
c1 = sumOfCost(i-1)+abs(H[i]-H[i-1])
c2 = sumOfCost(i-2)+abs(H[i]-H[i-2])
soc=min(c1,c2)
cost[i] = soc
return soc
print(sumOfCost(N-1))
| p03160 |
import sys
INF=100000000
def frog(i,h,dp):
global INF
if dp[i]!=INF:
return dp[i]
else:
if i==1:
dp[i]=0
return dp[i]
elif i==2:
dp[i]=abs(h[1]-h[0])
return dp[i]
else:
dp[i]=min(frog(i-2,h,dp)+abs(h[i-1]-h[i-3]),frog(i-1,h,dp)+abs(h[i-1]-h[i-2]))
return dp[i]
sys.setrecursionlimit(INF)
N=int(eval(input()))
h=list(map(int,input().split()))
dp=[INF for i in range(N+1)]
print((frog(N,h,dp)))
| INF=10**15
N=int(eval(input()))
h=list(map(int,input().split()))
dp=[INF for i in range(N)]
dp[0]=0
for i in range(1,N):
if i>1:
dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
else:
dp[i]=dp[i-1]+abs(h[i]-h[i-1])
print((dp[N-1])) | p03160 |
n = int(eval(input()))
hs = [int(x) for x in input().split()]
dp = [0, abs(hs[1] - hs[0])]
for i in range(2, n):
dp.append(min(dp[i-1] + abs(hs[i] - hs[i-1]), dp[i-2] + abs(hs[i] - hs[i-2])))
print((dp[n-1])) | n = int(eval(input()))
hs = [int(x) for x in input().split()]
dp = [0 for _ in range(n+1)]
dp[2] = abs(hs[1] - hs[0])
for i in range(3, n + 1):
one = dp[i-2] + abs(hs[i-1] - hs[i-3])
two = dp[i-1] + abs(hs[i-1] - hs[i-2])
dp[i] = min(one, two)
print((dp[n]))
| p03160 |
#配るDPで今度は解いてみる。
n=int(eval(input()))
H=list(map(int,input().split()))
#H[i]はi+1番目の足場の高さ
#dp[n] nまでのminimumコストを選んだときのコスト
dp= [float('inf') for i in range(n+2)]
dp[0]=0
for i in range(n-2):
dp[i+2]=min(dp[i+2],dp[i]+abs(H[i+2]-H[i]))
dp[i+1]=min(dp[i+1],dp[i]+abs(H[i+1]-H[i]))
#i=n-2
dp[n-1]=min(dp[n-1], dp[n-2]+abs(H[n-1]-H[n-2]))
print((dp[n-1])) | #配るDP
#Hの添字は1-indexに変更
n=int(eval(input()))
H=[0]+list(map(int,input().split()))
dp=[10**10]*(n+1)
dp[1]=0
for i in range(1,n):
if i+2<=n:
dp[i+2]=min(dp[i]+abs(H[i]-H[i+2]), dp[i+2])
dp[i+1]=min(dp[i]+abs(H[i]-H[i+1]), dp[i+1])
print((dp[n])) | p03160 |
N = int(eval(input()))
h = list(map(int, input().split()))
dp = [10 ** 10] * N
# dp[n]はあとnのところからのN-1に行くのに支払うコストの最小値
dp[0] = 0
dp[1] = abs(h[N-1]-h[N-2])
for n in range(0, N-2):
dp[n+2] = min(dp[n+1]+abs(h[(N-1)-(n+2)]-h[(N-1)-(n+1)]),
dp[n]+abs(h[(N-1)-(n+2)]-h[(N-1)-n]))
print((dp[N-1]))
| N = int(eval(input()))
h = list(map(int, input().split()))
a, b = 0, abs(h[0] - h[1])
for n in range(N - 2):
a, b = b, min(a + abs(h[n] - h[n + 2]), b + abs(h[n + 1] - h[n + 2]))
print(b)
| p03160 |
N, K = int(eval(input())), 2
*h, = list(map(int, input().split()))
a = [abs(h[0] - h[k]) for k in range(K)]
for n in range(N - K):
a = a[1:] + [min([a[k] + abs(h[n + k] - h[n + K]) for k in range(K)])]
print((a[K - 1]))
| n = int(eval(input()))
*H, = list(map(int, input().split()))
a, b = 0, abs(H[0]-H[1])
for i in range(2, n):
a, b = b, min(a+abs(H[i]-H[i-2]), b+abs(H[i]-H[i-1]))
print(b)
| p03160 |
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
dp = [[0, 0] for _ in range(N+1)]
# dp[i][j]: j=0 -> A[1] + ... + A[i] の MAX
# j=1 -> A[i] and A[i+1] を反転させた状態での和の最大値
dp[0][0] = 0
dp[0][1] = -float("inf")
for i in range(N):
dp[i+1][0] = max(dp[i][0] + A[i+1], dp[i][1] - A[i+1])
dp[i+1][1] = max(dp[i][0] - A[i+1], dp[i][1] + A[i+1])
print((dp[N][0])) | N = int(eval(input()))
A = list(map(int, input().split()))
abss = [abs(A[i]) for i in range(N)]
minus = [A[i] for i in range(N) if A[i] < 0]
if len(minus) % 2 == 0:
ans = sum([abs(A[i]) for i in range(N)])
print(ans)
else:
abss.sort()
ans = -abss[0] + sum(abss[1:])
print(ans)
| p03062 |
def main():
N = int(eval(input()))
A = list(map(int, input().split(" ")))
negative = 0
result = 0
abs_minimum = 10**9
for a in A:
abs_minimum = min(abs_minimum, abs(a))
if a < 0:
negative += 1
if negative % 2 == 0:
for a in A:
result += abs(a)
else:
for a in A:
if abs(a) == abs_minimum:
result += min(a, -a)
else:
result += abs(a)
print(result)
if __name__ == '__main__':
main() | def main():
n = int(eval(input()))
a = [int(x) for x in input().split()]
count_negative = 0
for i in range(n):
if a[i] < 0:
count_negative += 1
a = [abs(x) for x in a]
answer = sum(a)
if count_negative % 2:
answer -= 2 * min(a)
print(answer)
if __name__ == '__main__':
main()
| p03062 |
from sys import stdin
readline = stdin.readline
_, *aa = list(map(int, open(0).read().split()))
r = 0
mi = 1000000000
m = 0
for a in aa:
if a < 0:
m += 1
b = abs(a)
r += b
mi = min(b, mi)
print((r - mi * 2 * (m % 2)))
| from sys import stdin
readline = stdin.readline
def main():
_, *A = list(map(int, open(0).read().split()))
B = tuple(map(abs, A))
C = tuple(a for a in A if a < 0)
print((sum(B) - min(B)*2*(len(C)%2)))
if __name__ == "__main__":
main() | p03062 |
from sys import stdin
readline = stdin.readline
_, *aa = list(map(int, open(0).read().split()))
r = 0
mi = 1000000000
m = 0
for a in aa:
if a < 0:
m += 1
b = abs(a)
r += b
if b < mi:
mi = b
print((r - mi * 2 * (m % 2)))
| def main():
_ = eval(input())
A = tuple(map(int, input().split()))
B = tuple(map(abs, A))
C = tuple(a for a in A if a < 0)
print((sum(B) - min(B)*2*(len(C)%2)))
if __name__ == "__main__":
main() | p03062 |
_, *aa = list(map(int, open(0).read().split()))
r = 0
mi = 1000000000
m = 0
for a in aa:
if a < 0:
m += 1
b = abs(a)
r += b
if b < mi:
mi = b
print((r - mi * 2 * (m % 2)))
| from sys import stdin
readline = stdin.readline
n = readline()
aa = list(map(int, readline().split()))
r = 0
mi = 1000000000
m = 0
for a in aa:
if a < 0:
m += 1
b = abs(a)
r += b
if b < mi:
mi = b
print((r - mi * 2 * (m % 2)))
| p03062 |
N = int(eval(input()))
A = [int(x) for x in input().split()]
abs_list = sorted([abs(x) for x in A])[::-1]
for i in range(N-1):
if A[i] < 0:
A[i] *= -1
A[i+1] *= -1
if abs(min(A)) != min(abs_list):
A[A.index(min(A))] *= -1
A[A.index(min(abs_list))] *= -1
print((sum(A))) | # D
N = int(eval(input()))
A = [int(x) for x in input().split()]
minus_num = len([x for x in A if x < 0])
abs_list = [abs(x) for x in A]
if minus_num % 2:
print((sum(abs_list) - min(abs_list)*2))
else:
print((sum(abs_list))) | p03062 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
m = 10**18
for Ai in A:
if Ai<0:
cnt += 1
m = min(m, abs(Ai))
if cnt%2==0:
print((sum(abs(Ai) for Ai in A)))
else:
print((sum(abs(Ai) for Ai in A)-2*m)) | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 0
for Ai in A:
if Ai<0:
cnt += 1
if cnt%2==0:
print((sum(abs(Ai) for Ai in A)))
else:
A.sort(key=lambda x: abs(x))
print((-abs(A[0])+sum(abs(Ai) for Ai in A[1:]))) | p03062 |
N = int(eval(input()))
A = list(map(int, input().split(" ")))
while True:
updated = False
for i in range(N-1):
for j in range(i+1, N):
if (A[i] + A[j] < 0):
updated = True
A[i] *= -1
A[j] *= -1
updated = True
if not updated:
break
print((sum(A)))
| N = int(eval(input()))
A = list(map(int, input().split(" ")))
abs_list = list(map(abs, A))
abs_list.sort()
pos = list([x for x in A if x > 0])
neg = list([x for x in A if x < 0])
pos.sort()
neg.sort()
# A has 0
if abs_list[0] == 0:
print((sum(abs_list)))
elif len(neg) % 2 == 0:
print((sum(abs_list)))
elif len(pos) > 0 and abs(pos[0]) < abs(neg[-1]):
print((sum(abs_list) - 2*pos[0]))
else:
print((sum(abs_list[1:])-abs_list[0]))
| p03062 |
N = int(eval(input()))
A = list(map(int, input().split()))
nums = A[:]
import math
gcd_queue = [
(0, nums[0]),
]
for n in nums[1:]:
tmp_queue = []
for q in gcd_queue:
tmp_queue.append((q[0] + q[1], n))
tmp_queue.append((q[0] + q[1]*-1, n*-1))
gcd_queue = set(tmp_queue[:])
#print(gcd_queue)
gcd_queue = list(gcd_queue)
ans = gcd_queue[0][0] + gcd_queue[0][1]
for q in gcd_queue:
ans = max(ans, q[0]+q[1])
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
nums = A[:]
import math
gcd_queue = [
(0, nums[0]),
]
for n in nums[1:]:
tmp_queue = []
for q in gcd_queue:
tmp_queue.append((q[0] + q[1], n))
tmp_queue.append((q[0] + q[1]*-1, n*-1))
gcd_queue = set(tmp_queue[:])
#print(gcd_queue)
tmp = {}
for q in gcd_queue:
if str(q[1]) in tmp:
tmp[str(q[1])] = max(q[0], tmp[str(q[1])])
else:
tmp[str(q[1])] = q[0]
#print(tmp)
gcd_queue = []
for k, v in list(tmp.items()):
#print(k, v)
gcd_queue.append((v, int(k)))
gcd_queue = list(gcd_queue)
ans = gcd_queue[0][0] + gcd_queue[0][1]
for q in gcd_queue:
ans = max(ans, q[0]+q[1])
print(ans) | p03062 |
# ABC125D - Flipping Signs
def main():
N = int(eval(input()))
A = tuple(map(int, input().split()))
mi = min(abs(i) for i in A)
abs_sum = sum(abs(i) for i in A)
neg = sum(i < 0 for i in A)
if 0 in A or neg % 2 == 0:
print(abs_sum)
else:
print((abs_sum - mi * 2))
if __name__ == "__main__":
main() | # ABC125D - Flipping Signs
def main():
# neg % 2 == 0 -> all negatives disappear
# 0 in A -> move all neg there
# else -> move all neg to the smallest one (abs(i))
N = int(eval(input()))
A = tuple(map(int, input().split()))
mi = min(abs(i) for i in A)
abs_sum = sum(abs(i) for i in A)
neg = sum(i < 0 for i in A)
if 0 in A or neg % 2 == 0:
print(abs_sum)
else:
print((abs_sum - mi * 2))
if __name__ == "__main__":
main() | p03062 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.