annie11640389的专栏

/*表达式树 建立过程 ：找到“最后计算“的运算符(它是整棵表达式树的根),然后递归处理 * */ import java.util.Scanner; public class ExpressionTree { static final int MAXN = 1000; int[] lch = new int[MAXN]; int[] rch = new int[MAXN]; c

/*UVa 572 Oil Deposit*/ import java.io.InputStreamReader; import java.io.StreamTokenizer; import java.util.Arrays; public class Main { static final int MAXN = 105; int[][] g = new int[MAXN][

/*UVa 10305 Ordering Tasks*/ import java.util.Arrays; import java.util.Scanner; class Main { static final int MAXN = 105; int[][] g = new int[MAXN][MAXN]; int[] vis = new int[MAXN]; int[]

/* UVa 10596 Morning Walk * 思路：从出发点到出发点的欧拉回路(1)连通 (2)所有点的度为偶数*/ import java.util.Arrays; import java.util.Scanner; class Main { static final int MAXN = 205; int[][] g = new int[MAXN][MAXN];