Coldfresh的博客

In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the kingdom. The route should be

传送门 题目同上 史上速度最快ac#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<queue>using namespace std;const int maxn=2005;//点的最大上线const int maxx=44005;//边的最大上线const int INF=1<

On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to

自己写的最小花费最大流模板#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<queue>using namespace std;const int maxn=10010;//点数const int maxx=100100;//边数，注意为实际上边数的两倍const int INF=1<