searcharrow_forward
레벨
문제EXP
▪ B5
6113.5%29,2800.1%
▪ B4
5913.1%39,6480.1%
▪ B3
408.9%38,1600.1%
▪ B2
327.1%43,9680.1%
▪ B1
214.7%41,8320.1%
▪ S5
214.7%61,0890.2%
▪ S4
112.4%47,0360.1%
▪ S3
132.9%82,2770.2%
▪ S2
194.2%179,1700.5%
▪ S1
265.8%367,7701.0%
▪ G5
224.9%468,3361.3%
▪ G4
286.2%900,0602.5%
▪ G3
173.8%827,8832.3%
▪ G2
184.0%1,332,4143.7%
▪ G1
153.3%1,693,2754.7%
▪ P5
143.1%2,417,9966.7%
▪ P4
102.2%2,651,1707.3%
▪ P3
112.4%4,491,08012.4%
▪ P2
61.3%3,784,75210.4%
▪ P1
30.7%2,933,1818.1%
▪ D5
30.7%4,561,09812.6%
▪ D4
30.7%7,115,31319.6%
▪ 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
▪ 자료 구조
265.8%11,498,17331.7%
▪ 다이나믹 프로그래밍
5812.9%7,079,41019.5%
▪ 그래프 이론
5612.4%6,960,30819.2%
▪ 세그먼트 트리
102.2%6,577,03918.2%
▪ 이분 탐색
224.9%5,340,99714.7%
▪ 트리
51.1%4,962,54613.7%
▪ 느리게 갱신되는 세그먼트 트리
51.1%4,691,85613.0%
▪ 그래프 탐색
388.4%4,429,45312.2%
▪ 분할 정복
81.8%4,204,54511.6%
▪ 그리디 알고리즘
184.0%3,668,91610.1%
▪ 스위핑
102.2%3,439,1349.5%
▪ 너비 우선 탐색
286.2%3,370,4499.3%
▪ 구현
17238.1%2,957,9408.2%
▪ 트리를 사용한 집합과 맵
20.4%2,484,6566.9%
▪ 트리에서의 다이나믹 프로그래밍
10.2%2,371,7716.5%
더 보기