算法
关注
分享
扫一扫
文章平均质量分 74
EmslieWu
这个作者很懒，什么都没留下…
展开
-
poj1012
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A1012C{ static int k; static int[] data = new int[14]; public static void原创 2017-01-17 16:10:28 · 479 阅读 · 0 评论 -
求最大蛇的长度 本题只是笔记 代码是错的
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class anaconda { static class Node { int x; int y; int step; } static int N原创 2017-01-17 16:44:29 · 168 阅读 · 0 评论 -
HDU2614
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class ASolveProblem { static int data[][]; static int N, maxpro; static boolean原创 2017-01-17 16:50:10 · 196 阅读 · 0 评论 -
求空地的个数
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class AvacantRoom { static char map[][]; static int data[][]; static原创 2017-01-17 16:51:36 · 178 阅读 · 0 评论 -
cake1190
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class Cake1190 { static int N, M; static int mins; static int[] vmin; static i原创 2017-01-17 16:52:54 · 137 阅读 · 0 评论 -
FlipGame
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class FlipGame{ static int steps=Integer.MAX_VALUE; //(x,y)坐标合起来就是中心点及上下左右坐标啦原创 2017-01-17 16:56:00 · 285 阅读 · 0 评论 -
游戏过关
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class GuoGuan { static int N; static int min_cost; static int[] dataA; static原创 2017-01-17 16:57:22 · 246 阅读 · 0 评论 -
传染
package work;import java.io.FileNotFoundException;public class Infect2 { static node [] queue=new node[26];//队列里数组node[x,y,step] static int head=0;//头指针 static int tail=0;//尾指针 stati原创 2017-01-17 16:58:58 · 361 阅读 · 0 评论 -
poj1011
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class Main1011 {static int len;static int avg;static int[] seq;static boolea原创 2017-01-17 17:00:43 · 195 阅读 · 0 评论 -
toj1398Square
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class Square { static int total; static int N, T; static int[] sti; static int原创 2017-01-17 17:05:59 · 286 阅读 · 0 评论 -
poj1011Sticks
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class Sticks {static int N, total;static int sti[];static int len;static boole原创 2017-01-17 17:07:37 · 238 阅读 · 0 评论 -
poj1579
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class wshuzu1579 { static int a,b,c; static int size=21; static int w[][][]=原创 2017-01-17 17:12:52 · 270 阅读 · 0 评论 -
飞机炸弹
package xj;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class PlaneYang { static int N, max,sum; static int data[][]; static int x, y; s原创 2017-03-13 14:51:43 · 419 阅读 · 0 评论 -
轮胎充气
//我的代码package xj;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class LunTai { static int T, N,limit; static int data[][]; static int a[]; s原创 2017-03-13 17:03:41 · 343 阅读 · 0 评论 -
隧道TunnelsMeiju
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class TunnelsMeiju { static int N, V, H; static int[][] S; static int C1, R1, M1, C2原创 2017-01-17 17:09:53 · 273 阅读 · 0 评论 -
洗牌 我的代码
package xj;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class XiPai {static int T,N;static int data[];static int a[];static boolean flag原创 2017-03-15 15:05:31 · 351 阅读 · 0 评论 -
飞机花费
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class Airfare { static int T, N, mincost; static int data[][]; static boolean us原创 2017-01-17 16:43:06 · 358 阅读 · 0 评论 -
找环
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class Afindring { static int T,N,V; static boolean [][]map; st原创 2017-01-17 16:40:26 · 255 阅读 · 0 评论 -
虫洞 起点 终点 给你N条虫洞 虫洞所替代距离 虫洞起点 终点
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class AChongDong { static int T, N, mind; static int sx, sy, ex, ey; static int[原创 2017-01-17 16:39:18 · 271 阅读 · 0 评论 -
poj1017
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A1017 { static int sum; static int[] box = new int[6]; public static voi原创 2017-01-17 16:11:52 · 182 阅读 · 0 评论 -
poj1068
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A1068 { static int T, N; static int[] P = new int[20]; static int[] W; s原创 2017-01-17 16:12:40 · 177 阅读 · 0 评论 -
poj1129
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A1129singal { static int N,ans; static char[][] data; static boolean[][] m原创 2017-01-17 16:13:45 · 300 阅读 · 0 评论 -
poj1573Robot
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A1573Robot { static int N,M,S; static char [][] map; static int [][] data;原创 2017-01-17 16:15:05 · 155 阅读 · 0 评论 -
poj1644
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A1644 {static int T;static int K;public static void main(String args[]) th原创 2017-01-17 16:16:42 · 245 阅读 · 0 评论 -
poj2251
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A2251C { static class Node { int z; int x; int y; int step; }原创 2017-01-17 16:17:44 · 248 阅读 · 0 评论 -
poj2632
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A2632 { static int T, A, B, N, M; static int[] X; static int[] Y; static原创 2017-01-17 16:20:03 · 276 阅读 · 0 评论 -
poj2676
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A2676 { static int T; static int data[][]; static boolean row[][]; stati原创 2017-01-17 16:22:04 · 209 阅读 · 0 评论 -
poj2996
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A2996chess { static char [][]ch; //static char[] line=new char[33];public原创 2017-01-17 16:23:19 · 213 阅读 · 0 评论 -
poj3009
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A3009 { static int[][] S; static int W, H; static int[] Dx = { -1, 0, 1, 0原创 2017-01-17 16:24:27 · 370 阅读 · 0 评论 -
poj3050
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A3050 { static int [][]data; static int []Dx={-1,0,1,0}; static int []Dy={原创 2017-01-17 16:25:36 · 222 阅读 · 0 评论 -
poj3740
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class A3740 { static int[][] S; static int M, N; static boolean isfound; stati原创 2017-01-17 16:27:25 · 232 阅读 · 0 评论 -
港口钓鱼 求人员分配 移动最短距离值和 三个门
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class AboatC { static int T, N, mind; static int[] gate; static int[] peo; sta原创 2017-01-17 16:31:53 · 356 阅读 · 0 评论 -
Card NUmbers 给N个值为1-24的数 2+2=4 则会删去两个2和一个四 求剩下数的最小和
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class ACardNumber { static int data[]; static int T, minsum; public static void main原创 2017-01-17 16:34:52 · 227 阅读 · 0 评论 -
ceil细胞合并 每一秒一个细胞只能合并一次 求达到不可合并状态所需的秒数
package work;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class Aceil { static int data[]; static boolean used[]; static int minsec; pub原创 2017-01-17 16:37:06 · 272 阅读 · 0 评论 -
隧道 之后自己写的
package xj;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class Tunnels { static int T, N, H, V; static int S[][]; static int c1, r1, m1, c2, r2原创 2017-03-15 15:21:23 · 320 阅读 · 0 评论