searcharrow_forward
레벨
문제EXP
▪ B5
6113.1%29,2800.1%
▪ B4
5912.7%39,6480.1%
▪ B3
408.6%38,1600.1%
▪ B2
326.9%43,9680.1%
▪ B1
204.3%39,8400.1%
▪ S5
224.7%63,9980.2%
▪ S4
122.6%51,3120.1%
▪ S3
122.6%75,9480.2%
▪ S2
183.9%169,7400.4%
▪ S1
265.6%367,7701.0%
▪ G5
224.7%468,3361.2%
▪ G4
296.2%932,2052.4%
▪ G3
204.3%973,9802.6%
▪ G2
224.7%1,628,5064.3%
▪ G1
173.7%1,919,0455.0%
▪ P5
153.2%2,590,7106.8%
▪ P4
143.0%3,711,6389.7%
▪ P3
112.4%4,491,08011.8%
▪ P2
61.3%3,784,7529.9%
▪ P1
30.6%2,933,1817.7%
▪ D5
30.6%4,561,09812.0%
▪ D4
30.6%7,115,31318.7%
▪ D3
00.0%00.0%
▪ D2
00.0%00.0%
▪ D1
00.0%00.0%
▪ R5
00.0%00.0%
▪ R4
00.0%00.0%
▪ R3
00.0%00.0%
▪ R2
00.0%00.0%
▪ R1
00.0%00.0%
태그
문제EXP
▪ 자료 구조
337.1%12,594,08533.1%
▪ 다이나믹 프로그래밍
6012.9%7,688,08120.2%
▪ 그래프 이론
5812.5%7,429,07319.5%
▪ 세그먼트 트리
122.6%7,250,43619.0%
▪ 이분 탐색
224.7%5,200,85013.6%
▪ 트리
61.3%5,036,56913.2%
▪ 분할 정복
112.4%4,774,40912.5%
▪ 느리게 갱신되는 세그먼트 트리
51.1%4,691,85612.3%
▪ 그래프 탐색
398.4%4,489,93811.8%
▪ 그리디 알고리즘
224.7%4,189,35411.0%
▪ 스위핑
143.0%3,693,3489.7%
▪ 구현
17437.4%3,446,4709.0%
▪ 너비 우선 탐색
286.0%3,356,9118.8%
▪ 트리를 사용한 집합과 맵
30.6%2,710,9117.1%
▪ 트리에서의 다이나믹 프로그래밍
10.2%2,371,7716.2%
더 보기