Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
Skip to next slide
You can skip to the next slide in
3
Ad
×
Your browser does not support the video tag.
Skip to next slide
Ad
×
Share Slideshare
LinkedIn
Facebook
Twitter
Embed
Size (px)
Show related Slideshows at end
WordPress Shortcode
Link
Share
Email
4. dynamic programming(1)
by Hongjun Jang
7914 views
G
by Gimun Eom
5475 views
M
by Gimun Eom
5563 views
E
by Gimun Eom
5511 views
H
by Gimun Eom
5602 views
Baekjoon Online Judge 1492번 풀이
by Hongjun Jang
8101 views
View on Slideshare
1
of
14
Ad
View on Slideshare
1
of
14
Ad
![A. MODULO
• 1000 이하의 음이 아닌 정수가 주어지기 때문에 [1001]크기의
배열을 잡아서 counting 해주는 방법
• map<int, int>를 사용해서 마지막에 size()를 출력하는 방법](https://image.slidesharecdn.com/coci20062007contest1-160514114145/75/COCI-2006-2007-contest-1-solution-2-2048.jpg?cb=1667361855)
![E. BOND
• 그런데 방금처럼 짜면 메모리 초과가 납니다.
• 잘 관찰해보면 i번째 사람에 대한 DP 테이블을 채울 때, i-1번째 사람까지 다 계산되어있
는 D[i-1][~]만 참조합니다.
• 그래서 i를 0, 1...](https://image.slidesharecdn.com/coci20062007contest1-160514114145/75/COCI-2006-2007-contest-1-solution-11-2048.jpg?cb=1667361855)
