潮鸣り

广度优先搜索(Breadth-First-Search)和深度优先搜索(Deep－First－Search)是搜索策略中最经常用到的两种方法,特别常用于图的搜索.其中有很多的算法都用到了这两种思想,比如:Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想。 BFS的思想： 从一个图的某一个顶点V0出发，首先访问和V0相邻的且未被访问过的顶点V1、V2、

优先左转 优先右转  两点最短 #include #include #include #include #include #include #include using namespace std; typedef long long LL; const int INF = 0x3f3f3f3f; const int M = 1010; int dir[][2] = { 0,-1,-1,0,0

从天使的位置开始，直到找到r，优先队列每次选择最短时间的路 #include #include #include #include #include #include using namespace std; typedef long long LL; const int INF = 0x3f3f3f3f; const int M = 1010; struct node { int x, y

#pragma comment(linker, "/STACK:102400000,102400000") #include #include #include #include #include using namespace std; typedef long long LL; const long long mod = 1e9+7; const int inf = 0x3f3f3f

哎，学到了~！@~！@ //#pragma comment(linker, "/STACK:102400000,102400000") #include #include #include #include #include #include #include using namespace std; const int M = 60005; const int INF = 1e10; //

比赛的时候题意理解错了，不想多说什么了。。 水题一道，，给你四个按钮，每次你可以选择不动，左右移动按钮，按钮每P秒右移一次，，水啊 #include "stack" #include "cstdio" #include "iostream" #include "cmath" #include "set" #include "sstream" #include "cctype" #

#include "string" #include "iostream" #include "cstdio" #include "cmath" #include "set" #include "queue" #include "vector" #include "cctype" #include "sstream" #include "cstdlib" #include "c

全排列之后筛选。。 #include "string" #include "iostream" #include "cstdio" #include "cmath" #include "set" #include "queue" #include "vector" #include "cctype" #include "sstream" #include "cstdlib"

简单题，，， #include "string" #include "iostream" #include "cstdio" #include "cmath" #include "set" #include "queue" #include "vector" #include "cctype" #include "sstream" #include "cstdlib" #in

#include "string" #include "iostream" #include "cstdio" #include "cmath" #include "set" #include "queue" #include "vector" #include "cctype" #include "sstream" #include "cstdlib" #include "c

与其他bfs不同的是这种题需要用二进制来保存钥匙这个状态，需要多用一维数组来保存。。 可以通过位运算  | “拾取钥匙”， & “匹配钥匙”。 #include "string" #include "iostream" #include "cstdio" #include "cmath" #include "set" #include "queue" #include "vecto

Counting Sheep Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2308    Accepted Submission(s): 1519 Problem Description A while ago

#include "stack" #include "cstdio" #include "iostream" #include "cmath" #include "set" #include "sstream" #include "cctype" #include "string" #include "cstring" #include "algorithm" #include

Fire Net Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6948    Accepted Submission(s): 3932 Problem Description Suppose that we hav

#include #include using namespace std; #define M 100001 #define INF 10000000 struct POINT { int pos; int step; } now, next; int n, k; queueQ; bool visited[M]; int main() { int bfs(

LJ救公主，搜一遍就好，，   A计划 Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10660    Accepted Submission(s): 2580 Problem Description 可怜的公主

这题挖石油算是最基础的dfs了，入门学习可以看看，代码也是简单易懂，深入人心。                                                    Oil Deposits                                                Time Limit: 2000/1000 MS (Java/Others)    M

数独，开三个标记，直接暴力，400多mS还是可以接受的 #include #include #include #include #include #include #include using namespace std; typedef long long LL; const int INF = 0x3f3f3f3f; const int M = 1010; int vish[15][15]