Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2078	P1249D1 Too Many Segments (easy version) greedy *1800	0 / 0	(None)
	2077	P1249D2 Too Many Segments (hard version) data structures greedy sortings *1800	0 / 0	(None)
	2076	P1249E By Elevator or Stairs? dp shortest paths *1700	0 / 0	(None)
	2075	P1249F Maximum Weight Subset dp trees *2200	0 / 0	(None)
	2074	P1250A Berstagram implementation *1400	0 / 0	(None)
	2073	P1250B The Feast and the Bus brute force constructive algorithms greedy math *1800	0 / 0	(None)
	2072	P1250C Trip to Saint Petersburg data structures *2100	0 / 0	(None)
	2071	P1250D Conference Problem dp *3000	0 / 0	(None)
	2070	P1250E The Coronation graphs implementation *2300	0 / 0	(None)
	2069	P1250F Data Center brute force implementation *800	0 / 0	(None)
	2068	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	(None)
	2067	P1250H Happy Birthday math *1500	0 / 0	(None)
	2066	P1250I Show Must Go On binary search brute force greedy shortest paths *3100	0 / 0	(None)
	2065	P1250J The Parade binary search greedy *1800	0 / 0	(None)
	2064	P1250K Projectors flows graphs *3100	0 / 0	(None)
	2063	P1250L Divide The Students binary search greedy math *1500	0 / 0	(None)
	2062	P1250M SmartGarden constructive algorithms divide and conquer *2500	0 / 0	(None)
	2061	P1250N Wires dfs and similar graphs greedy *2000	0 / 0	(None)
	2060	P1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	(None)
	2059	P1251B Binary Palindromes greedy strings *1400	0 / 0	(None)

Pick a problem randomly based on the current filter.