forked from satnaing/astro-paper
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Affected files: .obsidian/workspace.json src/content/blog/dynamic-programming.md
- Loading branch information
Showing
2 changed files
with
57 additions
and
10 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,35 @@ | ||
--- | ||
author: Gyunseo Lee | ||
title: Dynamic Programming | ||
pubDatetime: 2024-02-13T21:33:00+09:00 | ||
modDatetime: 2024-02-13T21:33:00+09:00 | ||
featured: true | ||
draft: false | ||
tags: | ||
- test | ||
description: 동적 계획법(DP)에 대해 알아 보자... | ||
--- | ||
|
||
## Table of contents | ||
|
||
## 들어가며 | ||
|
||
## 기본 개념 | ||
|
||
### Greedy Algorithm이 실패하는 경우 | ||
|
||
### 최적해 구하기 | ||
|
||
### 해의 개수 세기 | ||
|
||
## 다른 예제들 | ||
|
||
### LIS(Longest Increasing Sequence) 최장 증가 부분 수열 | ||
|
||
### 격자상의 경로 | ||
|
||
### Knapsack 문제 | ||
|
||
### 순열을 부분 집합으로 바꾸기 | ||
|
||
### 타일 세기 |