Submission #1306946

Source Code Expand

n = gets.to_i
a = [0] + gets.split.map(&:to_i)
dp = []

dp[1] = 0
dp[2] = (a[2] - a[1]).abs
3.upto(n) do |i|
  dp[i] = [
    dp[i - 1] + (a[i] - a[i - 1]).abs,
    dp[i - 2] + (a[i] - a[i - 2]).abs,
  ].min
end

puts dp[n]

Submission Info

Submission Time
Task C - 柱柱柱柱柱
User sei0o
Language Ruby (2.3.3)
Score 100
Code Size 237 Byte
Status AC
Exec Time 103 ms
Memory 11652 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt
Case Name Status Exec Time Memory
sample_01.txt AC 7 ms 1788 KB
sample_02.txt AC 7 ms 1788 KB
sample_03.txt AC 7 ms 1788 KB
subtask1_01.txt AC 7 ms 1788 KB
subtask1_02.txt AC 7 ms 1788 KB
subtask1_03.txt AC 7 ms 1788 KB
subtask1_04.txt AC 102 ms 11652 KB
subtask1_05.txt AC 103 ms 11652 KB
subtask1_06.txt AC 101 ms 11652 KB
subtask1_07.txt AC 101 ms 11652 KB