divide and conquer - 题库

ID	题目显示标签隐藏标签	AC / 尝试	难度
8834	P1903D2 Maximum And Queries (hard version) bitmasks divide and conquer dp greedy *2500	0 / 0	9
8821	P1906K Deck-Building Game divide and conquer math *2500	0 / 0	9
9011	P1936E Yet Yet Another Permutation Problem divide and conquer fft math *3400	0 / 0	10
8916	P1952F Grid brute force divide and conquer expression parsing matrices	0 / 0	暂无评定
9091	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9
9040	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
9033	P1976D Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	0 / 0	暂无评定

根据当前过滤条件随机选择一道题

分类