two pointers - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8242	P1793C Dora and Search constructive algorithms data structures two pointers *1200	0 / 0	4
	8241	P1793D Moscow Gorillas binary search dp greedy implementation math two pointers *1800	0 / 0	6
	8240	P1793E Velepin and Marketing binary search data structures dp greedy sortings two pointers *2600	0 / 0	10
	8277	P1794C Scoring Subsequences binary search greedy math two pointers	0 / 0	(None)
	8271	P1796D Maximum Subarray data structures divide and conquer dp greedy math two pointers *2000	0 / 0	7
	8301	P1804B Vaccination greedy implementation two pointers	0 / 0	(None)
	8358	P1805E There Should Be a Lot of Maximums data structures dfs and similar dsu graphs trees two pointers	0 / 0	(None)
	8356	P1805F2 Survival of the Weakest (hard version) greedy math sortings two pointers	0 / 0	(None)
	8352	P1808D Petya, Petya, Petr, and Palindromes binary search brute force data structures two pointers *2100	0 / 0	7
	8369	P1811G2 Vlad and the Nice Paths (hard version) binary search combinatorics data structures dp math two pointers *2200	0 / 0	8
	8365	P1814D Balancing Weapons binary search brute force math two pointers	0 / 0	(None)
	8389	P1819B The Butcher geometry greedy implementation sortings two pointers *1900	0 / 0	6
	8387	P1819D Misha and Apples brute force data structures dp two pointers *2800	0 / 0	10
	8383	P1820B JoJo's Incredible Adventures math strings two pointers *1100	0 / 0	3
	8490	P1827A Counting Orders combinatorics math sortings two pointers *1100	0 / 0	3
	8489	P1827B1 Range Sorting (Easy Version) binary search dp dsu greedy trees two pointers *2000	0 / 0	7
	8440	P1832B Maximum Sum brute force sortings two pointers *1100	0 / 0	3
	8467	P1833F Ira and Flamenco combinatorics constructive algorithms data structures implementation math sortings two pointers *1700	0 / 0	5
	8556	P1835B Lottery binary search brute force greedy math two pointers *2500	0 / 0	9
	8448	P1840A Cipher Shifer implementation strings two pointers	0 / 0	(None)

Pick a problem randomly based on the current filter.