C++博客-Xredman编程小筑-随笔分类-HDOJhttp://www.cppblog.com/xredman/category/10485.htmlzh-cnThu, 14 May 2009 19:42:14 GMTThu, 14 May 2009 19:42:14 GMT60HDOJ2428(Stars)http://www.cppblog.com/xredman/archive/2009/05/13/82867.htmlXredmanXredmanWed, 13 May 2009 12:48:00 GMThttp://www.cppblog.com/xredman/archive/2009/05/13/82867.htmlhttp://www.cppblog.com/xredman/comments/82867.htmlhttp://www.cppblog.com/xredman/archive/2009/05/13/82867.html#Feedback0http://www.cppblog.com/xredman/comments/commentRss/82867.htmlhttp://www.cppblog.com/xredman/services/trackbacks/82867.html   2009-05-13 16:53:20 Accepted 2428 31MS 264K 1174 B C++ 
   本题给出一系列点坐标，要求求出有其中4个点组成的正方形有几个。可以将n个坐标按x从小到大排序，可以方便地寻找到2个点是x坐标相等的，若得到的是(x1, y1), (x1, y2),可以查找是否存在(x1 + y2 - y1, y1),(x1 + y2 - y1, y2),若存在，则可以构成一个正方形.

Xredman 2009-05-13 20:48 发表评论
]]>HDOJ1878（欧拉回路）http://www.cppblog.com/xredman/archive/2009/05/12/82716.htmlXredmanXredmanTue, 12 May 2009 10:01:00 GMThttp://www.cppblog.com/xredman/archive/2009/05/12/82716.htmlhttp://www.cppblog.com/xredman/comments/82716.htmlhttp://www.cppblog.com/xredman/archive/2009/05/12/82716.html#Feedback0http://www.cppblog.com/xredman/comments/commentRss/82716.htmlhttp://www.cppblog.com/xredman/services/trackbacks/82716.html   2009-05-12 17:37:32 Accepted 1878 46MS 236K 1346 B C++
   并查集判连通+无向图欧拉回路判定实现。
   无向图的欧拉回路判定：G连通，且G中均为偶度顶点。

Xredman 2009-05-12 18:01 发表评论
]]>HDOJ1198（Farm Irrigation）http://www.cppblog.com/xredman/archive/2009/05/11/82598.htmlXredmanXredmanMon, 11 May 2009 10:10:00 GMThttp://www.cppblog.com/xredman/archive/2009/05/11/82598.htmlhttp://www.cppblog.com/xredman/comments/82598.htmlhttp://www.cppblog.com/xredman/archive/2009/05/11/82598.html#Feedback0http://www.cppblog.com/xredman/comments/commentRss/82598.htmlhttp://www.cppblog.com/xredman/services/trackbacks/82598.htmlAccepted 1198 15MS 304K 1768 B C++ 
   用并查集判连通。对于二块是否连通的判断貌似有一点技巧可言。用dfs或bfs都可以做。

Xredman 2009-05-11 18:10 发表评论
]]>HDOJ1720(ACboy needs your help again!)http://www.cppblog.com/xredman/archive/2009/05/10/82508.htmlXredmanXredmanSun, 10 May 2009 12:38:00 GMThttp://www.cppblog.com/xredman/archive/2009/05/10/82508.htmlhttp://www.cppblog.com/xredman/comments/82508.htmlhttp://www.cppblog.com/xredman/archive/2009/05/10/82508.html#Feedback0http://www.cppblog.com/xredman/comments/commentRss/82508.htmlhttp://www.cppblog.com/xredman/services/trackbacks/82508.html2009-05-10 20:35:10 Accepted 1702 15MS 272K 937 B C++
水题，模拟栈和队列



Xredman 2009-05-10 20:38 发表评论
]]>HDOJ1711(Number Sequence)http://www.cppblog.com/xredman/archive/2009/05/10/82461.htmlXredmanXredmanSun, 10 May 2009 03:10:00 GMThttp://www.cppblog.com/xredman/archive/2009/05/10/82461.htmlhttp://www.cppblog.com/xredman/comments/82461.htmlhttp://www.cppblog.com/xredman/archive/2009/05/10/82461.html#Feedback0http://www.cppblog.com/xredman/comments/commentRss/82461.htmlhttp://www.cppblog.com/xredman/services/trackbacks/82461.html 2009-05-10 11:04:54 Accepted 1711 515MS 4192K 944 B C++
KMP算法最普通的运用

Xredman 2009-05-10 11:10 发表评论
]]>HDOJ1116(Play on Words)http://www.cppblog.com/xredman/archive/2009/05/10/82444.htmlXredmanXredmanSun, 10 May 2009 00:48:00 GMThttp://www.cppblog.com/xredman/archive/2009/05/10/82444.htmlhttp://www.cppblog.com/xredman/comments/82444.htmlhttp://www.cppblog.com/xredman/archive/2009/05/10/82444.html#Feedback0http://www.cppblog.com/xredman/comments/commentRss/82444.htmlhttp://www.cppblog.com/xredman/services/trackbacks/82444.html   本题意为将n个单词首尾相连组成一个单词链,如:acm->malform->mouse(a -> m -> m -> m ->m -> e)
   并查集+欧拉路实现
      1.并查集判连通，这点不用多说
      2.欧拉路，由图中可知除二端点外，其余字母的入度和出度均相等，二端点的出度和入度相差1,还有一种可能是，整个图就是一个欧拉回路，此时每个端点的入度和出度均相等
      2009-05-09 13:56:04 Accepted 1116 125MS 212K 2396 B C++

Xredman 2009-05-10 08:48 发表评论
]]>