dfs #include <stdio.h> #include <string.h> char Map[16][16]; int mv[16][16]; //mv[i][j] == 0 没有被访问 //mv[i][j] == 1 已经被访问 struct N { int x,y; } ; int jx[] = { 0,-1, 0, 1}; int jy[] = { 1, 0,-1, 0}; int Min; void dfs(int x,int y,int n,int m,int…

DFS 算法总结 这篇文章会对DFS进行一个总结,列举的题目则是从LeetCode上面选的: 适用场景: 有三个方面,分别是输入数据.状态转换图.求解目标: 输入数据:如果是递归数据结构,如单链表,二叉树,集合,则百分之百可以使用深搜:如果是非递归数据结构,比如一维数组.二维数组.字符串.图,则概率要小一些: 状态转换图:树或者图: 输入数据:必须要走到最深(比如对于树,必须要走到叶子结点)才能得到一个解,这种情况比较适合用深搜: 代码模版 /** * DFS模版 * @param input…

The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3): "123" "132" "213" "231" "312" "3…

Given a collection of numbers, return all possible permutations. For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]. 题解: 全排列,DFS. 在STL里面有一个next_permutation函数,如果数据量小的时候,这个函数还比较好用.不过当数据大后,next_p…

博弈这个东西真的很费脑诶.. 尼姆博奕(Nim Game):游戏者轮流从一堆棋子(或者任何道具)中取走一个或者多个,最后不能再取的就是输家.当指定相应数量时,一堆这样的棋子称作一个尼姆堆 当n堆棋子的数量满足a1 xor a2 xor a3 xor.......xor an=0(Bouton's Theorem)时 为必败态,即先手必败(对于这种局面我们叫它奇异局面),对于尼姆博弈这种游戏,寻找必败态是非常重要的,那么对于必败态 有: 1.无法进行任何移动的自然是比败态 2.可以移动到必败态的是…

How far away ? Tarjan http://www.cnblogs.com/caiyishuai/p/8572859.html Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20491    Accepted Submission(s): 8010 Problem Description There are n house…

1008. Airline Routes (35) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 CHEN, Yue Given a map of airline routes, you are supposed to check if a round trip can be planned between any pair of cities. Input Specification: Each input file cont…

Apple Tree Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 25904   Accepted: 7682 Description There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been…

[二叉树遍历模版]前序遍历     1.递归实现 test.cpp: 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960   #include <iostream>#include <cstdio>#include <stack>#include <vector>#include &quo…

Ordering Tasks John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task isonly possible if other tasks have already been executed.InputThe input will consist of several instances of the problem. Each instance…