[BOJ] 2667. 단지번호붙이기(BFS, DFS).java

#. Problemhttps://www.acmicpc.net/problem/2667* 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. 8. 6. 17:54
[BOJ] 1730. 판화(배열 탐색)

#. Problemhttps://www.acmicpc.net/problem/1730* 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 #. Code123456789101..
PS/Problem_Solving 2020. 8. 6. 17:47
[BOJ] 2468. 안전 영역(DFS, BFS)

#. Problemhttps://www.acmicpc.net/problem/2468* 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. 8. 6. 00:55
[BOJ] 1874.스택 수열(Stack)

#. Problemhttps://www.acmicpc.net/problem/1874* 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 stack에 열심히 push 해주다..
PS/Problem_Solving 2020. 8. 2. 22:10
[BOJ] 14888. 연산자 끼워넣기(순열)

#. Problemhttps://www.acmicpc.net/problem/14888* 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. 8. 2. 21:00
[SWEA] 1961. 숫자 배열 회전(Array Rotation)

#. Problemhttps://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5Pq-OKAVYDFAUq&categoryId=AV5Pq-OKAVYDFAUq&categoryType=CODE* The copyright in this matter is in SWEA #. 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) ..
PS/Problem_Solving 2020. 7. 22. 23:30
[BOJ] 2146. 다리 만들기

#. Problemhttps://www.acmicpc.net/problem/2146* 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 4963. 섬의 개수 문제의 확장판..
PS/Problem_Solving 2020. 7. 6. 20:27
[BOJ] 2178. 미로 탐색(BFS, DP)

#. Problemhttps://www.acmicpc.net/problem/2178* 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 알리바바와 40인 도둑 문제와 유사..
PS/Problem_Solving 2020. 6. 29. 19:00
1 ··· 15 16 17 18 19 20 21 ··· 39
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more