deepquiet的博客

tips: 回溯 use a queue to restore the temporary marked array(vis) , and when it back, set vis = 0 first floor give out all the received res, and combine with all the d to make new res, and mark all l

题意: 从1出发,到达给的点有几种走法 所有的走法显然是需要回朔来求的,为避免超时,我们要剪枝 那么最重要的就是用到的flo,这个方法可以判断通路(即当前点i是否可达终点),如果不可达就剪枝 那么没达到终点,我们就把路径输出,路径存于一个数组中 代码: #include #include #include using namespace std; const int mmax = 0x