[Inflearn] 최대점수 구하기(DP, 냅색 알고리즘, knapsack algorithm)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 각 문제는 그것을 풀었을 때 얻는 점수와 푸는데 걸리는 시간이 주어짐- 제한시간 M 안에 N개의 문제 중 최대점수를 얻을 수 있도록 - 해당 문제는 해당 시간이 걸리는 푸는 걸로 간주- 한 유형당 한 개만 풀 수 있음 3. Create solution plan (select Algorithm, Data structure) 4. P..
PS/Problem_Solving 2020. 6. 1. 14:32
[Inflearn] 동전교환(DP, 냅색 알고리즘, knapsack algorithm)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 거스름돈을 가장 적은 수의 동전으로 교환- 각 단위의 동전은 무한정 사용 가능 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan ..
PS/Problem_Solving 2020. 6. 1. 11:05
[Algorithm] 가방문제(냅색 알고리즘, knapsack algorithm)

#. Problem https://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98 * The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to ..
PS/Algorithm 2020. 6. 1. 10:26
[Inflearn] 알리바바와 40인의 도둑(DP : Top-Down)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
PS/Problem_Solving 2020. 5. 31. 21:02
[Inflearn] 알리바바와 40인의 도둑(DP : Bottom-Up)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 해당 돌다리를 건널 때 돌의 높이 만큼 에너지가 소비- 이동은 최단 거리 이동- 현재 지점에서 오른쪽 도는 아래쪽으로만 이동- 출발점에서 도착점까지 가는데 드는 에너지의 최소량 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check pe..
PS/Problem_Solving 2020. 5. 30. 12:23
[Inflearn] 가장 높은 탑 쌓기(DP, LIS)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
PS/Problem_Solving 2020. 5. 30. 10:51
[Inflearn] 최대 선 연결하기(DP, LIS)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
PS/Problem_Solving 2020. 5. 29. 14:09
[Algorithm] 최대 부분 증가수열(DP, LIS : Longest Increasing Subsequence)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
PS/Algorithm 2020. 5. 28. 16:06
1 ··· 3 4 5 6 7
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more