KOREATECH 1011: 징검다리

Link : judge.koreatech.ac.kr/problem.php?id=1011

---

Python

from sys import stdin
 
testcase = int(stdin.readline().strip())
 
while testcase:
    length = int(stdin.readline().strip())
    dp = [0] * length
    if length > 2:
        arr = list(map(int, stdin.readline().strip().split(' ')))
        for _ in range(3):
            dp[_] = arr[_]
 
        for idx in range(3, len(arr)):
            dp[idx] = min(dp[idx-1], dp[idx-2], dp[idx-3]) + arr[idx]
 
        print(min(dp[-1],dp[-2],dp[-3]))
        testcase-=1
    else:
        try:
            arr = list(map(int, stdin.readline().strip().split(' ')))
        except Exception: pass
        finally:
            print(0)

FeedBack

1. try except 문구보다 좀 더 좋은 처리방법을 생각해야 함.

---

 

 

 

cjw.git@gmail.com