-
https://www.acmicpc.net/problem/1946
https://www.acmicpc.net/problem/1931
-
## 개요
- 탐욕 알고리즘은 말 그대로 탐욕적이게(?) 문제를 해결하는 방법이다.
- 우선순위가 높은 것 부터 차례대로 처리한다는 뜻으로 당연히 우선순위가 높은 순으로 **정렬**이 선행되어야한다.
- 어떤 기준으로 어떻게 정렬할 것인지 선정하는게 알고리즘을 학습하는 것과 더불어 중요한 센스같다.
## 예제
### 섬 연결하기
- [문제 바…
-
[프로그래머스 > 탐욕법 > 체육복 ](https://programmers.co.kr/learn/courses/30/lessons/42862)
-
Vered hayakara,
greedy from part one which used the wrong Dijkstra is plain wrong itself, it does not do what it is expected to do.
On the other hand, greedy-search in the second part as implemented…
-
- わかりやすい/変更しやすいようにコードを書き直す + 疑似コード/計算量の分析などをメモに残す．
- [ ] std_risk_greedy
- [ ] sqd_risk_greedy
- [ ] STD_greedy
- [ ] SQD_greedy
- [ ] SUTD_greedy
-
### What happened?
While below is our site configuration, I have explicitly disabled the portion of the code that causes this issue as a stopgap solution. But this is reproducible even on the docum…
-
You are given `n` activities, each with its start time and end time. Your task is to select the maximum number of activities that can be performed by a single person, assuming that a person can only w…
-
does this repo also contain code for greedy-nbv & target-pomdp? I want to run the comparison. Thanks!
-
Hi everyone, I would like to change the get_greedy_perm function so that it is not always taken in the sample the first point but a random point. I tried it, I changed the source code but i dont know,…
-
I suggest we treat terminators and separators as delimiters with an empty opening delimiter and hence unify the three error correction strategies