Coldfresh的博客

There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this “How far is it if I want to go from house A to house B”? Usually it hard to...

HDU - 2767(强连通分量) 求一个有向图里加最少的边使得任意两点可达。。import java.util.ArrayList;import java.util.Arrays;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ ...

没有具体例图，就是直接找出，那些边是桥。import java.util.Arrays;import java.util.Scanner;public class Main{ static int SIZE=100010; static int head[]=new int[SIZE],to[]=new int[SIZE<<1],next[]=ne...

In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten Apples....

题目来源Drainage Ditches HDU - 1532 ，裸的最大流 代码： 选用dinic有如下优势 1.代码量小，容易记忆。 2.效率上比EK算法快很多，虽然比asp稍慢，但是是可以接受的。import java.util.Arrays;import java.util.Scanner;public class Main{ final static...

来自裸题：过山车 HDU - 2063 代码：import java.util.Arrays;import java.util.Scanner;public class Main{ final static int maxn=1005; final static int maxx=2005; final static int INF =0x3f3f3...