Submission #1308164

Source Code Expand

N = int(raw_input())
a = map(int, raw_input().split())
dp = [10**10 for i in range(N)]
dp[0] = 0
for i in range(N):
    if i < N-1:
        dp[i+1] = min(dp[i+1], dp[i] + abs(a[i+1] - a[i]))
    if i < N-2:
        dp[i+2] = min(dp[i+2], dp[i] + abs(a[i+2] - a[i]))
print dp[N-1]

Submission Info

Submission Time
Task C - 柱柱柱柱柱
User namakemono
Language Python (2.7.6)
Score 100
Code Size 288 Byte
Status AC
Exec Time 165 ms
Memory 12176 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 10 ms 2568 KB
sample_02.txt AC 10 ms 2568 KB
sample_03.txt AC 11 ms 2568 KB
subtask1_01.txt AC 10 ms 2568 KB
subtask1_02.txt AC 10 ms 2568 KB
subtask1_03.txt AC 10 ms 2568 KB
subtask1_04.txt AC 165 ms 12048 KB
subtask1_05.txt AC 154 ms 12048 KB
subtask1_06.txt AC 156 ms 12176 KB
subtask1_07.txt AC 157 ms 12052 KB