摘要：
题目描述给定 nn 个点，mm 条有向边，给定每条边的容量，求从点 ss 到点 tt 的最大流。输入格式第一行包含四个正整数nn、mm、ss、tt，用空格分隔，分别表示点的个数、有向边的个数、源点序号、汇点序号。... 阅读全文
摘要：
DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move... 阅读全文
摘要：
DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale are... 阅读全文