searcharrow_forward
david9224
Diamond III 15.82%
17,614,169 / 111,354,660−93,740,491
Diamond III 15.82%17,614,169 / 111,354,660−93,740,491
레벨
문제EXP
▪ B5
625.6%29,7600.0%
▪ B4
655.9%43,6800.0%
▪ B3
14713.3%140,2380.1%
▪ B2
12511.3%171,7500.1%
▪ B1
555.0%109,5600.1%
▪ S5
655.9%189,0850.1%
▪ S4
504.5%213,8000.1%
▪ S3
686.2%430,3720.2%
▪ S2
615.5%575,2300.3%
▪ S1
746.7%1,046,7300.5%
▪ G5
615.5%1,298,5680.6%
▪ G4
534.8%1,703,6850.8%
▪ G3
333.0%1,607,0670.7%
▪ G2
282.5%2,072,6440.9%
▪ G1
211.9%2,370,5851.1%
▪ P5
423.8%7,253,9883.3%
▪ P4
242.2%6,362,8082.9%
▪ P3
222.0%8,982,1604.1%
▪ P2
90.8%5,677,1282.6%
▪ P1
90.8%8,799,5434.0%
▪ D5
131.2%19,764,7589.0%
▪ D4
50.5%11,858,8555.4%
▪ D3
10.1%3,711,8221.7%
▪ D2
40.4%23,310,24010.7%
▪ D1
30.3%27,535,22112.6%
▪ R5
40.4%58,007,53226.5%
▪ R4
10.1%22,985,48510.5%
▪ R3
00.0%00.0%
▪ R2
00.0%00.0%
▪ R1
00.0%00.0%
태그
문제EXP
▪ 다이나믹 프로그래밍
17115.5%91,507,64141.8%
▪ 자료 구조
938.4%77,154,64435.3%
▪ 세그먼트 트리
433.9%51,187,33723.4%
▪ 트리
242.2%37,810,12317.3%
▪ 느리게 갱신되는 세그먼트 트리
111.0%36,903,33816.9%
▪ 분할 정복
141.3%31,147,50014.2%
▪ 히르쉬버그
20.2%28,813,04513.2%
▪ 우선순위 큐
80.7%24,166,97211.0%
▪ 함수 개형을 이용한 최적화
30.3%24,041,26511.0%
▪ 그리디 알고리즘
333.0%19,779,6059.0%
▪ 분리 집합
90.8%15,235,5757.0%
▪ 문자열
746.7%15,180,7406.9%
▪ 트리에서의 다이나믹 프로그래밍
30.3%14,597,1946.7%
▪ 비트 집합
10.1%14,501,8836.6%
▪ 작은 집합에서 큰 집합으로 합치는 테크닉
10.1%14,501,8836.6%
더 보기