#include <iostream> #include <time.h> #include <cassert> using namespace std; const int totalFloorNum = 10; const int totalStopNum = 4; int nPerson[totalFloorNum + 1]; int minFloors[totalFloorNum + 1][totalStopNum + 1]; int targetFloors[totalFloorNum + 1][totalStopNum + 1]; //stopNum floors between…
2011-11-11 17:43 · 评论(0)
我没有区分清楚动态规划和递归的区别!下面dp是动态规划,dp1是递归,dp1会超时! package problem1221; import java.util.Scanner; public class Main { private static final int MAXNUM = 300; private static long [][] mat = new long[MAXNUM][MAXNUM]; /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method s…
2010-11-26 15:36 · 评论(0)
由于两道题实际为同一道题,故仅贴出2593的解法: (值得注意的是,由于2479的时间要求较为严格,故最好使用StreamTokenizer处理输入,我试过换成Scanner,但始终超时!) package problem2593; import java.io.*; public class Main { /** * @param args */ public static void main(String[] args) throws IOException{ // TODO Auto-generated method stub StreamTokenizer in = new Stre…
2010-11-25 16:13 · 评论(0)
package problem1015; import java.util.ArrayList; import java.util.Collections; import java.util.Scanner; public class Main { static int candidateNum; static int jurMemNum; static int [] sub; static int [] plus; static int totValRangeSize; static int totValDelta; /*F[i][j] means among i candidates, …
2010-11-10 22:01 · 评论(0)
最大流算法(Shortest Augmenting Path): package problem1087; import java.util.ArrayList; import java.util.LinkedList; import java.util.Scanner; public class MainMaxFlow_SAP { static int recptNum; static int [] recpt; static int deviceNum; static int [] device; static int adapterNum; static int typeNum; st…
2010-11-04 18:00 · 评论(0)