[BOJ] 4811. 알약(DP).java

#. Problemhttps://www.acmicpc.net/problem/4811* 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. 27. 22:10
[BOJ] 2116. 주사위 쌓기(구현).java

#. Problemhttps://www.acmicpc.net/problem/2116* 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. 25. 23:24
[BOJ] 가장 긴 증가하는 부분 수열(LIS)Series.java

#. Series 1https://www.acmicpc.net/problem/11053* The copyright in this matter is in BOJ #. Solve 나무위키에 LIS의 자세한 설명이 기록되어있다(링크) #. Code 12345678910111213141516171819202122232425262728293031323334353637383940414243import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer; public class BOJ11053 { public static void main(String[] args..
PS/Problem_Solving 2020. 9. 24. 13:29
[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] 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
1 2 3 4 5
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more