随笔分类 -  未做

有时间做一下
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=3436 阅读全文
posted @ 2013-05-27 19:58 zhang1107 阅读(127) 评论(0) 推荐(0)
摘要:x1+x2+........+xk=N1x1+2x2+........+kxk=N求所有满足条件的sum(mul(xi)) 阅读全文
posted @ 2013-05-24 18:03 zhang1107 阅读(106) 评论(0) 推荐(0)
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=3541http://blog.csdn.net/kang205/article/details/6305159 阅读全文
posted @ 2013-05-20 15:36 zhang1107 阅读(94) 评论(0) 推荐(0)
摘要:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=20333#problem/A 阅读全文
posted @ 2013-05-09 23:39 zhang1107 阅读(140) 评论(0) 推荐(0)
摘要:资料:http://wenku.baidu.com/view/1845fdc75fbfc77da269b1ae.html http://wenku.baidu.com/view/e7c220c52cc58bd63186bdae.html 阅读全文
posted @ 2013-05-02 20:18 zhang1107 阅读(113) 评论(0) 推荐(0)
摘要:http://www.codeforces.com/problemset/problem/266/D资料:最小直径生成树 阅读全文
posted @ 2013-01-23 18:56 zhang1107 阅读(146) 评论(0) 推荐(0)
摘要:http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=18541#problem/Hdp要搞懂 阅读全文
posted @ 2013-01-21 19:05 zhang1107 阅读(126) 评论(0) 推荐(0)
摘要:http://wenku.baidu.com/view/0631c375f242336c1eb95e1a.html 阅读全文
posted @ 2013-01-16 22:29 zhang1107 阅读(123) 评论(0) 推荐(0)
摘要:资料:http://wenku.baidu.com/view/0a8cd3c5bb4cf7ec4afed0c4.html http://www.gamedev.net/page/resources/_/technical/artificial-intelligence/a-pathfinding-for-beginners-r2003学习A*所要做的题目:①第k短路②15数码③第k短简单路。 阅读全文
posted @ 2012-12-31 17:22 zhang1107 阅读(156) 评论(0) 推荐(0)
摘要:From:http://hi.baidu.com/aekdycoin/item/90065df1b0f5b412ce9f32d6Wiki:http://en.wikipedia.org/wiki/Dancing_Links论文参考:http://gaoyunxiang.com/wp-content/uploads/2010/02/Dancing_Links.pdfDancing Linkshttp://acm.hust.edu.cn/problem.php?id=1017过程:http://en.wikipedia.org/wiki/Algorithm_X模板题,测试模板的正确性。http:/ 阅读全文
posted @ 2012-12-29 00:32 zhang1107 阅读(131) 评论(0) 推荐(0)
摘要:参考资料:http://en.wikipedia.org/wiki/Gaussian_elimination习题集_From:这里http://poj.org/problem?id=3185http://poj.org/problem?id=2947http://poj.org/problem?id=1222 阅读全文
posted @ 2012-12-28 19:59 zhang1107 阅读(132) 评论(0) 推荐(0)
摘要:参考:http://www.matrix67.com/blog/archives/276DNA Sequence 阅读全文
posted @ 2012-12-27 20:56 zhang1107 阅读(164) 评论(0) 推荐(0)
摘要:资料:http://en.wikipedia.org/wiki/Delaunay_triangulation#Algorithmshttp://poj.org/problem?id=2820 阅读全文
posted @ 2012-12-25 21:28 zhang1107 阅读(146) 评论(0) 推荐(0)
摘要:题目:https://www.interviewstreet.com/challenges/dashboard/#problem/4f6522ab2f425论文:http://www.ii.uni.wroc.pl/~lorys/IPL/article79-2-3.pdf没事多看看论文,好像是这么说的,神级论文。 阅读全文
posted @ 2012-12-19 19:01 zhang1107 阅读(124) 评论(0) 推荐(0)
摘要:From:这里 阅读全文
posted @ 2012-12-15 22:17 zhang1107 阅读(112) 评论(0) 推荐(0)
摘要:Form:http://blog.163.com/lazy_p/blog/static/13510721620108139476816/ 阅读全文
posted @ 2012-12-15 21:19 zhang1107 阅读(197) 评论(0) 推荐(0)
摘要:组合数 阅读全文
posted @ 2012-12-07 23:21 zhang1107 阅读(107) 评论(0) 推荐(0)
摘要:E. Race暴力 阅读全文
posted @ 2012-12-07 17:32 zhang1107 阅读(151) 评论(0) 推荐(0)
摘要:Colorful Rainbows凸包扫描法 阅读全文
posted @ 2012-12-07 17:08 zhang1107 阅读(139) 评论(0) 推荐(0)
摘要:Full Tank? 最短路 阅读全文
posted @ 2012-12-06 23:14 zhang1107 阅读(243) 评论(0) 推荐(0)