data structures - 题库 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	7090	P4C Registration system data structures hashing implementation *1300	1 / 3	4
	7086	P5C Longest Regular Bracket Sequence constructive algorithms data structures dp greedy sortings strings *1900	2 / 4	6
	7084	P5E Bindian Signalizing data structures *2400	0 / 0	9
	7079	P6E Exposition binary search data structures dsu trees two pointers *1900	1 / 7	6
	7050	P12D Ball data structures sortings *2400	0 / 0	9
	7044	P13E Holes data structures dsu *2700	1 / 2	10
	7035	P15D Map data structures implementation sortings *2500	0 / 0	9
	7021	P18C Stripe data structures implementation *1200	3 / 4	4
	7015	P19D Points data structures *2800	0 / 0	10
	6973	P28D Don't fear, DravDe is kind binary search data structures dp hashing *2400	0 / 0	9
	6969	P29C Mail Stamps data structures dfs and similar graphs implementation *1700	0 / 0	5
	6962	P30E Tricky and Clever Password binary search constructive algorithms data structures greedy hashing strings *2800	0 / 0	10
	6937	P35E Parade data structures sortings *2100	0 / 0	7
	6929	P37C Old Berland Language data structures greedy trees *1900	0 / 0	6
	6920	P38G Queue data structures *2300	0 / 0	8
	6881	P44G Shooting Gallery data structures implementation *2500	0 / 0	9
	6875	P45C Dancing Lessons data structures *1900	0 / 0	6
	6865	P46D Parking Lot data structures implementation *1800	0 / 0	6
	6864	P46E Comb data structures dp *1900	0 / 0	6
	6858	P47E Cannon data structures geometry sortings *2200	0 / 0	8
	6831	P52C Circular RMQ data structures *2200	1 / 1	8
	6813	P56C Corporation Mail data structures expression parsing implementation *1700	0 / 0	5
	6811	P56E Domino Principle binary search data structures sortings *2200	0 / 0	8
	6786	P61E Enemy is weak data structures trees *1900	1 / 1	6
	6768	P66C Petya and File System data structures implementation *1800	0 / 0	6
	6766	P66E Petya and Post data structures dp *2000	0 / 0	7
	6762	P67D Optical Experiment binary search data structures dp *1900	0 / 0	6
	6757	P68D Half-decay tree data structures divide and conquer dp math probabilities *2500	0 / 0	9
	6751	P69E Subsegments data structures implementation *1800	0 / 0	6
	6748	P70C Lucky Tickets binary search data structures sortings two pointers *2200	0 / 0	8
	6747	P70D Professor's task data structures geometry *2700	0 / 0	10
	6731	P74D Hanger data structures *2400	0 / 0	9
	6726	P75D Big Maximum Sum data structures dp greedy implementation math trees *2000	0 / 0	7
	6719	P76F Tourist binary search data structures dp *2300	0 / 0	8
	6706	P79C Beaver data structures dp greedy hashing strings two pointers *1800	0 / 0	6
	6694	P82C General Mobilization data structures dfs and similar sortings *2000	0 / 0	7
	6683	P85B Embassy Queue data structures greedy *1800	0 / 0	6
	6681	P85D Sum of Medians binary search brute force data structures implementation *2300	1 / 2	8
	6676	P86D Powerful array data structures implementation math two pointers *2200	0 / 0	8
	6665	P89C Chip Play brute force data structures implementation *2300	0 / 0	8
	6659	P91B Queue binary search data structures *1500	1 / 1	5
	6656	P91E Igloo Skyscraper data structures geometry *2500	0 / 0	9
	6251	P100G Name the album special problem data structures implementation 1800	0 / 0	6
	6626	P101B Buses binary search data structures dp *1700	0 / 1	5
	6617	P103D Time to Raid Cowavans brute force data structures sortings *2100	0 / 0	7
	6589	P111B Petya and Divisors binary search data structures number theory *1900	0 / 0	6
	6582	P113B Petr# brute force data structures hashing strings *2000	0 / 1	7
	6572	P115E Linear Kingdom Races data structures dp *2400	1 / 3	9
	6565	P117E Tree or not Tree data structures divide and conquer implementation trees *2900	0 / 0	10
	6540	P121E Lucky Array data structures *2400	0 / 0	9

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