[BOJ] 1938.통나무 옮기기(BFS).java

#. Problemhttps://www.acmicpc.net/problem/1938* 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 통나무를 열심히 옮겨보는 BFS +..
PS/Problem_Solving 2020. 9. 23. 22:12
[BOJ] 2096.내려가기(DP, 슬라이드 윈도우).java

#. Problemhttps://www.acmicpc.net/problem/2096* 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. 9. 23. 14:55
[BOJ] 1149.RGB거리(DP).java

#. Problemhttps://www.acmicpc.net/problem/1149* 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 문제의 규칙은 3개지만결국엔 나와 ..
PS/Problem_Solving 2020. 9. 23. 11:06
[BOJ] 11048.이동하기(DP).java

#. Problemhttps://www.acmicpc.net/problem/11048* 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 최대 N, M 을 간과하고 푼다면..
PS/Problem_Solving 2020. 9. 23. 10:51
[SWEA] 1251.하나로(MST, kruskal, prim).java

#. Problemhttps://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV15StKqAQkCFAYD&categoryId=AV15StKqAQkCFAYD&categoryType=CODE* 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..
PS/Problem_Solving 2020. 9. 23. 00:10
[SWEA] 3282. 0/1 Knapsack(DP).java

#. Problemhttps://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWBJAVpqrzQDFAWr&categoryId=AWBJAVpqrzQDFAWr&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. 9. 22. 21:07
[BOJ] 4179.불(BFS).java

#. Problemhttps://www.acmicpc.net/problem/4179* 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. 9. 16. 20:31
[BOJ]17780.새로운 게임(시뮬레이션).java

#. Problemhttps://www.acmicpc.net/problem/17780* 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. 9. 15. 23:59
1 ··· 18 19 20 21 22 23 24 ··· 34
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more