| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | |||||
| 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| 10 | 11 | 12 | 13 | 14 | 15 | 16 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 |
| 24 | 25 | 26 | 27 | 28 | 29 | 30 |
| 31 |
- SQLD
- 밑바닥부터 시작하는 딥러닝
- Baekjoon
- Regularization
- deep learning
- CNN
- 딥러닝
- computer vision
- CPP
- assignment2
- Algorithm
- Machine Learning
- Python
- BFS
- do it! 알고리즘 코딩테스트: c++편
- marchine learning
- RNN
- mask r-cnn
- Optimization
- C++
- Adam
- Generative Models
- dropout
- cs231n
- 밑바닥부터 시작하는 딥러닝2
- assignment1
- DFS
- Transformer
- Positional Encoding
- paper review
- Today
- Total
목록dynamic programming (2)
newhaneul
[Baekjoon/Python] 2156번: 포도주 시식(Dynamic Programming)
# Baekjoon 2156번: 포도주 시식import sysinput = sys.stdin.readlineN = int(input())cost = []dp = [0] * Nfor i in range(N): cost.append(int(input()))if N == 1: dp[0] = cost[0]elif N == 2: dp[1] = cost[0] + cost[1]else: dp[0] = cost[0] dp[1] = cost[0] + cost[1] dp[2] = max(cost[0] + cost[2], dp[1], cost[1] + cost[2])for i in range(3, N): dp[i] = max(dp[i-2] + cost[i], dp[i-3] + cost[..
[Baekjoon/Python] 1149번: RGB거리(Dynamic Programming)
# Baekjoon 1149번: RGB거리import sysinput = sys.stdin.readlineN = int(input())RGB = []dp = [[0]*3 for _ in range(N+1)]for i in range(N): cost = list(map(int, input().split())) RGB.append(cost)dp[0][0] = RGB[0][0]dp[0][1] = RGB[0][1]dp[0][2] = RGB[0][2]for i in range(1, N): dp[i][0] = min(dp[i-1][1], dp[i-1][2]) + RGB[i][0] dp[i][1] = min(dp[i-1][0], dp[i-1][2]) + RGB[i][1] dp[i][2] =..