Dimpleney的博客

package Graph_tu; import java.util.ArrayList; import java.util.Arrays; import java.util.LinkedList; public class Gragh { private ArrayList<String>vertexList;//存储节点 private int[][]edges;//存储邻接矩阵 private int numofEdges; private static boolean[]

package planning; import java.math.BigInteger; import java.util.Scanner; public class Cutcake { static int w,h,m;//宽，高，m块 static int dp[][][];//三维数组存放可切最大面积下限 public static final int INF=999; public static void main(String[] args) { // TODO Auto-ge

法一：递归版 package planning; import java.util.*; public class Pocket { static int a[];//物体体积 public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc=new Scanner(System.in); int n=sc.nextInt(); a=new int[n+1]; for(in

package planning; import java.util.*; public class Skating {//类似数字三角形的递归写法 static int map[][]; static int dp[][]; static int sum,r,c; public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc=new Scanner(System.in);

package planning; import java.util.*; public class LCS { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc=new Scanner(System.in); //int n=sc.nextInt(); String str1=sc.nextLine(); String str2=sc.nextLine().

##最佳加法表达式（求最小值）