摘要：
hdu1024 Max Sum Plus Plus Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more 阅读全文
摘要：
B. Mike and strings time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Mike has n strings s 阅读全文
摘要：
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this 阅读全文
摘要：
题目： Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irr 阅读全文
摘要：
原地址：http://www.wutianqi.com/?p=1890 这篇博客写的非常简洁易懂，其中各个函数的定义也很清晰，配合图表很容易理解这里只选取了 其中一部分（插不来图片）。 Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以 阅读全文
摘要：
C. Maximal GCD time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given positive int 阅读全文