[BOJ] 1260. DFS와 BFS(DFS, BFS)

#. Problemhttps://www.acmicpc.net/problem/1260* The copyright in this matter is in BOJ #. 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 ..
PS/Problem_Solving 2020. 6. 24. 15:21
[BOJ] 1012. 유기농 배추,py(BFS, DFS, Flood Fill)

#. Problemhttps://www.acmicpc.net/problem/1012* The copyright in this matter is in BOj #. 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 improve it #. Solve섬의 개수(?)를 구하는 문제랑 같다..
PS/Problem_Solving 2020. 5. 24. 01:50
[Inflearn] 피자 배달 거리(삼성 SW역량평가 기출 : 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 - 0은 빈칸, 1은 집, 2는 피자집 - 행과 열은 1번부터 N번까지 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Lo..
PS/Problem_Solving 2020. 5. 9. 23:49
[Inflearn] 수식만들기(삼성 SW역량평가 기출 : 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 - 연산자는 덧셈, 뺄셈, 곱셈, 나눗셈 - 수열의 순서는 유지한 채 각 항사이에 N-1개의 연산자를 적절히 배치 - 연산자 우선순위를 따지지 않고 맨 앞쪽 연산자부터 차례로 계산 - 연산 결과가 최대인 것과 최소인 것을 출력 3. Create solution plan (select Algorithm, Data structure) ..
PS/Problem_Solving 2020. 5. 9. 21:43
[Inflearn] 휴가(삼성 SW역량평가 기출 - DFS) (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 - N일동안 최대한 많은 상담 - 최대 이익이 나는 스케쥴 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..
PS/Problem_Solving 2020. 5. 9. 00:43
[Inflearn] 순열구하기(DFS : Depth First Search)

#. 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 - 자연수 N과 R이 주어지면, 서로 다른 N개의 자연수 중 R개를 뽑아 일렬로 나열 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the pl..
PS/Problem_Solving 2020. 5. 8. 12:39
[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..
PS/Problem_Solving 2020. 5. 3. 00:04
[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..
PS/Problem_Solving 2020. 5. 2. 23:34
1 ··· 8 9 10 11 12 13
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more