搜索资源列表
zoj_1004_Anagrams_by_Stack.rar
- zoj 1004 的题目，这是一个经典的水壶倒水问题，题目中没有要求最少的次数倒满水，所以还可以不用bfs，本题用了bfs,zoj 1004 topics, this is a classic problem of water pouring money down the drain, the title does not require a minimum number of filling water, so it can be bfs, the title used bfs
ZOJ
- 这是一份ZOJ的ACM题解，包含大多数题目的AC程序，是学习算法的好东西~-This is a problem solution ZOJ the ACM, including most of the topics AC program, learning algorithm is a good thing ~
zoj_1009_Enigma
- 这是一道模拟题目，属于比较容易的，但是其中用到了一个类似于循环队列的东西，感到还是很有意思的-This is a simulation of the subject, are relatively easy, but the cycle is similar to using a queue of things are still very interesting
zoj_1013_Great_Equipment
- 这是一道经典的DP题目，如果不做就太遗憾了，我刚开始没有做出来，后来看了别人的解题报告才做出来的-This is a classic topic of DP, if not too sorry, I did not do it just started, after reading other people' s problem-solving done by the report of
zoj_ACM_works
- 渐江大学ACM的试题全集，很详细，也很实用-ACM gradually Jiang University Complete Works of questions, very detailed and also very practical
theKthNumberInASegment(segmentTree)
- 可以快速地查询某段区间的第k元素,是zoj上的Dynamic ranking 的源程序-query the kth number in a segment
zoj-1051-A-New-Growth-Industry
- poj 1051 源代码。已经测试通过 AC-poj 1051 source code. Has been tested by AC
1
- 浙大算法竞赛的一道题目，多项式求和。本程序给出了它的简单实现以及标准答案。(A problem of Zhejiang University algorithm competition, polynomial summation. This program gives its simple implementation as well as the standard answer.)