data structures - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1663	P1332G No Monotone Triples data structures *3100	0 / 0	(None)
	1660	P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	(None)
	1651	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	(None)
	1645	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	(None)
	1644	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
	1643	P1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	(None)
	1636	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	(None)
	1626	P1340A Nastya and Strange Generator brute force data structures greedy implementation *1500	0 / 0	(None)
	1621	P1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	(None)
	1615	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	(None)
	1609	P1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	(None)
	1607	P1343F Restore the Permutation by Sorted Segments brute force constructive algorithms data structures greedy implementation *2400	0 / 0	(None)
	1602	P1344E Train Tracks data structures trees *3100	0 / 0	(None)
	1593	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	(None)
	1591	P1346H Game with Segments special problem data structures games 2700	0 / 0	(None)
	1588	P1348B Phoenix and Beauty constructive algorithms data structures greedy sortings *1400	0 / 0	(None)
	1584	P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	(None)
	1583	P1349A Orac and LCM data structures math number theory *1600	0 / 0	(None)
	1572	P1351C Skier data structures implementation *1400	0 / 0	(None)
	1561	P1353D Constructing the Array constructive algorithms data structures sortings *1600	0 / 0	(None)

Pick a problem randomly based on the current filter.