ID	题目显示标签隐藏标签	AC / 尝试	难度
3493	ADACITY Ada and Cities shortest-path max-flow matching	0 / 0	(无)
3492	ADAPATH Ada and Path max-flow matching	0 / 0	(无)
2806	BANKROB Bank robbery max-flow	0 / 0	(无)
1955	BCAKE Birthday Cake max-flow dynamic-programming	0 / 0	(无)
470	COCONUTS Coconuts max-flow min-cut	0 / 0	(无)
847	DISJPATH Disjoint Paths max-flow	0 / 0	(无)
985	FASTFLOW Fast Maximum Flow max-flow	0 / 0	(无)
236	GREED Greedy island max-flow minimum-cost-flow	0 / 0	(无)
354	IM Intergalactic Map max-flow	0 / 0	(无)
1017	MATCHING Fast Maximum Matching max-flow matching	0 / 0	(无)
1076	MOBIVINA MobiZone vs VinaGone max-flow min-cut	0 / 0	(无)
1024	MSE06I "Shortest" pair of paths max-flow	0 / 0	(无)
888	MTOTALF Total Flow max-flow	0 / 0	(无)
193	NETADMIN Smart Network Administrator max-flow	0 / 0	(无)
149	POTHOLE Potholers max-flow sorting bfs	0 / 0	(无)
3157	SELLPHN2 Mobile Company 2 max-flow	0 / 0	(无)
1067	SHOP2 Shopping II max-flow	0 / 0	(无)
240	TAXI Taxi max-flow matching	0 / 0	(无)

分类

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

动态规划