DFS
zzti_xiaowei
xxx
展开
-
poj-3009 Curling 2.0
[题目链接]思路:只是一个dfs搜索题,还是太菜,come on,baby 代码:#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int inf=0x3f3f3f3f;const in...原创 2018-05-18 19:23:27 · 98 阅读 · 0 评论 -
zznu-2025 简单环路
[题目链接]思路: dfs搜索题,对于每一个坐标记录走到的步数,对于相同字母的坐标(x,y)可一步到达(X,Y),如果(X,Y)坐标已走过,并且d(x,y)-d(X,Y)≥3的话,则存在环路。代码:#include<iostream>#include<cstdio>#include<cstring>#include<algorithm&g...原创 2018-05-13 22:24:12 · 153 阅读 · 0 评论 -
AOJ-0118 Property Distribution
[题目链接]思路 :很简单的搜索题,求连通分块数目啦,想想蓝桥杯省赛用Dev调的那道天气变暖就好气好气,略略略~ 代码 : #include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int Ma...原创 2018-04-28 19:02:07 · 107 阅读 · 0 评论 -
Aizu-0525 Osenbei
[题目链接]思路:由于n比较小,可以对行dfs枚举出所有状态,然后对每一列贪心选择,如果一列1比较多,则此列不翻转,反之如果0比较多则翻转就好了。代码:#include<iostream>#include<cstdio>#include<set>#include<cstring>#include<algorithm&...原创 2018-05-23 10:44:56 · 262 阅读 · 0 评论