-
搜索专题
会场预约找一个最小的r加进集合12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include <cstdio> #include <algorithm> #include<iostream> #define maxn 1000000 # …
-
cicada
正解还不会用暴力搜索弄到了90.。。bfs与dfs都能过90思路：先弄一个f数组记得是这个点的最短路，就是破败指针在爆搜剪枝bfs12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758#include<cstdio>#inclu …
-
抓住那头牛
广度优先搜索，深搜超时需要判断界限，做标记，已到过的地点就不必去了12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758#include<cstdio>#include<iostream>using namespac …