annie11640389的专栏

/* * UVa 112 - Tree Summing * */import java.io.IOException;import java.io.InputStreamReader;import java.io.StreamTokenizer;import java.util.LinkedList;//方法一：用栈class TreeSuming { public stat

import java.util.Arrays;import java.util.Scanner;/*UVa 10003 - Cutting Sticks * 最小矩阵链成类似 状态转移方程 f(i,j) = min {f(i,k) + f(k,j) + (c[j]-c[i])} * 由于划分阶段比较困难 选择使用记忆化搜索 * */class Main { static f

/*基于邻接表和优先级队列的Dijkstra算法实现 * */import java.util.Arrays;import java.util.Comparator;import java.util.PriorityQueue;import java.util.Scanner;class Node { int value; int num; public

/*UVa 558 - Wormholes * 使用邻接表存储图 * */import java.util.Arrays;import java.util.LinkedList;import java.util.Scanner;public class Main { static final int MAX = 1 << 20; static final int N = 100

/*UVa 10465 HomerSimpson*/import java.util.Arrays;import java.util.Scanner;class HomerSimpson { static final int MAXN = 10005; static int[] d = new int[MAXN]; static int t; static int[] w = ne

/*UVa 437 - The Tower of Babylon * 矩形嵌套问题 DP + DAG + LIS * */import java.util.Arrays;import java.util.Scanner;class Block { int x; int y; int z; public Block(int x, int y, int z) { this.

/*UVa 10397 - Connect the Campus * 把已存在的边权设为0 然后使用Kruscal算法 求最小生成树 * */import java.util.Arrays;import java.util.Comparator;import java.util.Scanner;class Edge { int u;// 边的起点 int v;// 边的终点 d

/*UVa 10369 - Arctic Network * 使用Kruscal算法 求最小生成树 * 将使用到的边排序 排除最大的s-1个 剩下的边中最大的即为所求 * */import java.util.Arrays;import java.util.Comparator;import java.util.Scanner;class Edge { int u;// 边的

/*UVa 10608 Friends 并查集*/import java.util.Scanner;class Main { static final int MAXN = 30005; static int[] fa = new int[MAXN]; static int[] count = new int[MAXN]; static int n, m; static int

/*10801 - Lift Hopping * 以每一层楼为顶点，每个电梯可以到达的两层楼之间的秒数为每一条边的权值， * 以此构建一个无向图。然后利用dijkstra求出最短的时间， * 注意每次换乘电梯需要等待60s（注意初始定点不需要60s的等待）。*/import java.util.Arrays;import java.util.Scanner;class Main {

/*UVa 562 Dividing Coins * 思路 ： 如果arr[j]==1 那么 arr[j+a[i]]==1*/import java.util.Arrays;import java.util.Scanner;class Main { static final int MAXN = 50010; int[] arr = new int[MAXN]; int[] a =

/*UVa 10131 - Is Bigger Smarter? * 变形的LCS 先将大象按体重增长排序，若大象体重相同，按IQ降序排列， * 排序后问题转化为求IQ的一个最长递减子序列 * d[i]表示以i为终点的重量上升速度下降的序列 * */import java.util.Arrays;import java.util.Comparator;import java.util

/*UVa 357 - Let Me Count The Ways*/import java.util.Scanner;class Main { public static void main(String[] args) throws Exception { int arr[] = { 1, 5, 10, 25, 50 }; long dp[] = new long[30001]

/* 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];

/*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 10404 - Bachet's Game * d[i]=1表示Stan赢， d[i]=0表示输 那么只要有一个j使得d[i-arr[j]]==0那么d[i]=1; * */import java.util.Scanner;class Main { public static void main(String[] args) { Scanner s

/*UVa 103 - Stacking Boxes * */import java.util.Arrays;import java.util.Scanner;class Main { public static final int MAXD = 15;// 最大维数 public static final int MAXN = 35;// 最大box数目 int[][] g =

/* * Uva 993 Product Of Digits * */import java.util.LinkedList;import java.util.Scanner;class ProductOfDigits { LinkedList stack = new LinkedList(); public static void main(String[] args) {

/* * UVa 507 Jill Rides Again * */import java.util.Scanner;class Main { static final int MAX = 20005; public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int

/* * UVa 10282 字典 * *///import java.io.BufferedInputStream;//import java.io.FileInputStream;import java.util.Scanner;class Main { static final int SEED = 131;// 31,131,1313,13131,131313... st

/* * UVa 10391 复合词 * */import java.io.BufferedInputStream;import java.io.FileInputStream;import java.util.Scanner;class CompoundWords { static final int SEED = 131;// 31,131,1313,13131,131313

/* * UVa 10066 - The Twin Towers * */import java.util.Scanner;class TheTwinTowers { public static void main(String[] args) { int n1, n2; Scanner scanner = new Scanner(System.in); int coun

/* * UVa 10192 - Vacation * */import java.util.Scanner;class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int count = 0; String s1,s2; while

/* * UVa 348 - Optimal Array Multiplication Sequence * */import java.util.Scanner;class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); in

/* 算法导论 15.5-1 打印最优二叉查找树 * 最优二叉查找树 * e[i,j] = q[i-1](j = i-1) e[i,j] = min{e[i,r-1] + r[r+1,j] + w[i,j] | i=<r<=j} * w[i,j] = w[i,j-1] + p[j] + q[j] * root[i,j]为k[r]的下标 k[r]是包含关键字的一棵最

import java.util.Scanner;class Main { public static void main(String[] args) { int t; Scanner scanner = new Scanner(System.in); t = scanner.nextInt(); while(t > 0) { t--; i

import java.util.Scanner;/* * UVa 624 CD * */class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (scanner.hasNext()) { int n = scanner.ne

/*UVa 10285 Longest run on a snowboard */import java.util.Arrays;import java.util.Scanner;class Main { static final int MAX = 105; int[][] arr = new int[MAX][MAX];//在数组外加上边框不用考虑出界的问题 int[][] d

/*UVa 10304 - Optimal Binary Search Tree * e(i,j)为搜索一棵包含节点f[i]...f[j]的最优二叉搜索树的代价 * 如果区间规模增大，则要选出一个新的根节点，而区间上除了根节点左右最优解之外， * 子树中每个节点要要增加一个高度 * k1 = max(k – 1, i)，k2 = min(k + 1, j); * e[i][j] = mi

/*UVa 10405 - Longest Common Subsequence * */import java.util.Scanner;class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (scanner.hasNext()

/*UVa 674 - Coin Change * d(i)表示i的换算方式种数 d(i) = d(i)+d[i-coins[j]] coins[](50,25,10,5,1) * */import java.util.Scanner;class Main { static final int MAX = 7489 + 5; static int[] coins = new in

/*UVa 111 - History Grading * 最长公共子序列 * */import java.util.Scanner;class Main { static final int MAX = 25; public static void main(String[] args) { Scanner scanner = new Scanner(System.in);

/*UVa 147 - Dollars*/import java.util.Scanner;class Main { static final int MAX = 30001; public static void main(String[] args) { int[] arr = new int[]{5,10,20,50,100,200,500,1000,2000,5000,100