标题 | 阅读 | 评论 | 转发 | 发布日期 | |
---|---|---|---|---|---|
poj 2002 Squares(查找) | 1081 | 1 | 0 | 2009-09-02 | |
poj 1035 Spell checker(查找) | 1128 | 0 | 0 | 2009-09-01 | |
poj 1200 Crazy Search | 2039 | 0 | 0 | 2009-09-01 | |
poj 2503 Babelfish(查找) | 1578 | 1 | 1 | 2009-08-31 | |
poj 1861 Network(kruskal) | 1066 | 0 | 0 | 2009-08-31 | |
poj 2524 Ubiquitous Religions(并查集) | 1333 | 0 | 0 | 2009-08-31 | |
poj 1308 Is It A Tree? | 2053 | 0 | 0 | 2009-08-31 | |
poj 1258 Agri-Net | 1072 | 0 | 0 | 2009-08-30 | |
kruskal算法2 | 611 | 0 | 0 | 2009-08-30 | |
poj 1251 Jungle Roads(Prim) | 743 | 0 | 0 | 2009-08-30 | |
poj 1797 Heavy Transportation | 696 | 0 | 0 | 2009-08-29 | |
poj 1125 Stockbroker Grapevine | 784 | 0 | 0 | 2009-08-29 | |
poj 1062 昂贵的婚礼 | 908 | 0 | 0 | 2009-08-29 | |
poj 2709 Painter(贪心) | 2271 | 0 | 0 | 2009-08-28 | |
poj 1221 Unimodal Palindromic Decompositions(DP) | 2014 | 0 | 0 | 2009-08-27 | |
poj 1080 Human Gene Functions(DP) | 2327 | 3 | 0 | 2009-08-27 | |
poj 1018 Communication System(枚举+贪心) | 4494 | 0 | 0 | 2009-08-26 | |
poj 1050 To the Max(DP简单题) | 7038 | 0 | 0 | 2009-08-26 | |
poj 2479 Maximum sum(DP简单题) | 3205 | 0 | 0 | 2009-08-22 | |
poj 3083 Children of the Candy Corn (深搜+广搜) | 1747 | 2 | 0 | 2009-08-10 |
chinaunix网友2009-11-15 14:04
真的很强.. 虽然我不是学算法的,可是看了一些你的文章,感觉你很厉害..! 呵呵.. 我今天刚刚过了,学校acm的初赛..就有一题青蛙约会的问题,可惜没做出来.. 没事,我自己给自己打气,决赛的时候一定要加油!