是一个图论的基础搜索题- 没什么好说的就是搜索就好 主要是别把 代码写的太屎,错了不好找 #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> using namespace std; int sx,sy,ex,ey; struct info { int x,y; char ko; int qian; }; info que[40]; bool flag[10][10];…

Basic wall maze Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 168    Accepted Submission(s): 52 Special Judge Problem Description In this problem you have to solve a very simple maze consisti…

Basic Wall Maze Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3384   Accepted: 1525   Special Judge Description In this problem you have to solve a very simple maze consisting of: a 6 by 6 grid of unit squares 3 walls of length between…

poj2935:http://poj.org/problem?id=2935 题意:在6*6的格子中,有一些,如果两个格子之间有墙的话,就不能直接相通,问最少要经过几步才能从起点走到终点.并且输出路径. 题解:直接bfs #include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<queue> using namespace std; str…

BFS. /* 1484 */ #include <iostream> #include <queue> #include <string> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; typedef struct { int x, y; string s; } node_t; ][][]; ][]; ] = "…

id=3026">[POJ 3026]Borg Maze 一个考察队搜索alien 这个考察队能够无限切割 问搜索到全部alien所须要的总步数 即求一个无向图 包括全部的点而且总权值最小(最小生成树 BFS+最小生成树 Prim/Kruskal-懒死了 就这么贴吧--凑活看(￣┰￣*) #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #i…

http://poj.org/problem?id=3026 Borg Maze Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 12086   Accepted: 3953 Description The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg coll…

题目链接:http://poj.org/problem?id=3026. Description The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Ea…

http://poj.org/problem?id=1113 答案是凸包周长+半径为l的圆的周长... 证明?这是个坑.. #include <cstdio> #include <cstring> #include <cmath> #include <string> #include <iostream> #include <algorithm> #include <queue> #include <set>…

http://poj.org/problem?id=1113 Wall Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 34616   Accepted: 11821 Description Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King's castle. Th…