searcharrow_forward
dennisstar
Ruby IV 63.11%
580,269,333 / 919,419,400−339,150,067
Ruby IV 63.11%580,269,333 / 919,419,400−339,150,067
레벨
문제EXP
▪ B5
10.4%4800.0%
▪ B4
00.0%00.0%
▪ B3
00.0%00.0%
▪ B2
10.4%1,3740.0%
▪ B1
00.0%00.0%
▪ S5
00.0%00.0%
▪ S4
10.4%4,2760.0%
▪ S3
72.6%44,3030.0%
▪ S2
00.0%00.0%
▪ S1
41.5%56,5800.0%
▪ G5
00.0%00.0%
▪ G4
31.1%96,4350.0%
▪ G3
00.0%00.0%
▪ G2
20.7%148,0460.0%
▪ G1
41.5%451,5400.0%
▪ P5
20.7%345,4280.0%
▪ P4
51.8%1,325,5850.1%
▪ P3
41.5%1,633,1200.1%
▪ P2
31.1%1,892,3760.1%
▪ P1
114.0%10,754,9970.5%
▪ D5
4115.1%62,335,0063.1%
▪ D4
2910.7%68,781,3593.4%
▪ D3
3713.6%137,337,4146.8%
▪ D2
197.0%110,723,6405.5%
▪ D1
228.1%201,924,95410.0%
▪ R5
5118.8%739,596,03336.7%
▪ R4
186.6%413,738,73020.5%
▪ R3
41.5%146,187,6847.3%
▪ R2
20.7%116,584,6785.8%
▪ R1
00.0%00.0%
태그
문제EXP
▪ 자료 구조
11241.2%860,716,23642.7%
▪ 다이나믹 프로그래밍
9836.0%787,284,83039.1%
▪ 세그먼트 트리
6724.6%535,888,72626.6%
▪ 트리
5219.1%465,707,16523.1%
▪ 그리디 알고리즘
4014.7%418,685,91020.8%
▪ 분할 정복
3312.1%355,952,94517.7%
▪ 그래프 이론
4416.2%345,069,84317.1%
▪ 이분 탐색
259.2%255,029,21612.7%
▪ 트리에서의 다이나믹 프로그래밍
248.8%244,883,96012.2%
▪ 분리 집합
269.6%222,730,87411.1%
▪ 느리게 갱신되는 세그먼트 트리
197.0%193,221,2719.6%
▪ 작은 집합에서 큰 집합으로 합치는 테크닉
155.5%192,833,9209.6%
▪ 오프라인 쿼리
186.6%192,045,6989.5%
▪ 수학
197.0%128,576,3636.4%
▪ 볼록 껍질을 이용한 최적화
228.1%121,601,6266.0%
더 보기