![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dfs
文章平均质量分 57
囧九
大学萌新
展开
-
HDU 2586 How far away?
There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this "How far is it if I want to go from house A to house B"? Usually it hard to...原创 2018-08-01 19:34:23 · 119 阅读 · 0 评论 -
FatMouse and Cheese HDU - 1078
FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid lo...原创 2018-08-07 20:02:00 · 275 阅读 · 0 评论 -
Problem H Sheba’s Amoebas
求图中环的个数 简单dfs #include<iostream> #include<cstring> #include<cstdio> #include<algorithm> using namespace std; int vis[110][110]; int vis1[110][110]; char mp[110][110]; int c...原创 2018-08-16 16:12:39 · 523 阅读 · 0 评论 -
E - Counting Cliques HDU - 5952
A clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with N vertices and M edges, your task is to count the number of cliques with a specific size ...原创 2018-09-12 17:25:59 · 237 阅读 · 0 评论