#. 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 - D일 안에 와서 강연을 해 주면 M 만큼의 강연료 - D와 M을 바탕으로 가장 많이 돈을 벌 수 있도록 스케쥴을 짜야 함 - 강연은 하루에 하나의 강연 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance tim..
#. 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..
[Algorithm] 최대힙(priority_queue : 우선순위 큐)(c/c++)
#. 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 - 자연수가 입력되면 최대힙에 입력 - 숫자 0 이 입력되면 최대힙에서 최댓값을 출력 ( 출력할 자료가 없으면 -1 출력) - -1 이 입력되면 프로그램 종료 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance t..
#. 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을 외친 왕자가 제외 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 f..
[Inflearn] 송아지 찾기(BFS : 상태트리탐색)
#. 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 - 직선상의 좌표 - 앞으로 1, 뒤로 1, 앞으로 5 이동 가능 - 최소 몇 번의 점프로 송아지의 위치까지 갈 수 있는가 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory..
[Inflearn] 그래프 최단거리(BFS : Queue 사용)
#. 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 - 1번 정점에서 각 정점으로 가는 최소 이동 간선 수 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 o..
[Algorithm] 이진트리 너비우선탐색(BFS : 배열 사용)
#. 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..
[Inflearn] 최소비용(DFS : 가중치 방향그래프 인접리스트 사용)
#. 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..