搜索资源列表
poj 2175源代码
- poj上排名进了前十的代码，不容错过。
1001.zip POJ 1001己AC源代码
- ＰＯＪ １００１己ＡＣ源代码，不信你可以试试．,POJ 1001 F AC source code, do not believe you can try.
POJ_report.rar
- 总共80多道题的POJ详细解题报告，每道题带ppt说明，很好很强大 ,A total of more than 80 questions the POJ report detailed problem-solving, with each title ppt shows that a good strong
poj01
- poj acm 1664 2694 2749 2816 递归算法部分题解～～很经典的递归应用-poj acm 1664 2694 2749 2816 recursive algorithm for part of the problem solution ~ ~ a very classic recursive application of
3016886_AC_998MS_24392K
- 适合acmer，poj 3476 的代码，强烈推荐学习此代码-Suitable for acmer, poj 3476 code, it is strongly recommended to study this code
POJ1000-1010
- ACM 相关的，POJ 1000-1010的全部解答，程序十分完备 部分还有文字说明-ACM-related, POJ 1000-1010 all the answers, procedures, and there is still a very complete text descr iption
jihe
- 三道几何题：hdu 1007、hdu 2289、poj 3714-Three geometry question: hdu 1007, hdu 2289, poj 3714
123456ACM
- ACM POJ上的源码~~1000-3217一共719道题，这是网站http://acm.pku.edu.cn/JudgeOnline/，非常好的C++源码-ACM POJ on the source code ~ ~ 1000-3217 a total of 719 questions, this is the site http://acm.pku.edu.cn/JudgeOnline/, a very good C++ source code ~ ~
2533
- poj上的第2533题，用dp实现求一个字符串的最长递增子序列，时间是O(n)，语言是C-poj the first 2533 title, with dp achieve demand a string of the longest increasing subsequence, the time is O (n), the language is C++
zoj1002-firenet
- poj 1002 源代码。已经测试通过 ac
1042
- poj 1042 Gone Fishing 枚举加贪心思想,也可用动态规划做-poj 1042 Gone Fishing enumeration plus greedy thinking, dynamic programming can also be used to do
tanxin
- 北京大学程序在线评测系统(POJ)中关于贪心算法的一个解题程序-Peking University program online evaluation system (POJ), a greedy algorithm on problem solving process
POJ
- POJ1048，加强版的约瑟夫问题 难度中等-POJ1048, enhanced version of Joseph problems
poj 1050 动态规划 最大子矩阵
- poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵
poj
- POJ 上的近100道水题，基本涵盖了所有基本算法和数据结构，全部AC-POJ on nearly 100 water question, basically covers all the basic algorithms and data structures, all AC
POJ-1890-Switching-Channels
- POJ 1890 Switching Channels. 搜索算法的练习题。-POJ 1890 Switching Channels. Exercises of the search algorithm.
POJ-2151
- POJ 2151 Check the difficulty of problems. Practice for dynamic planning.
POJ-1170
- POJ 1170 动态规划。欢迎各种交流讨论。-POJ 1170 dynamic programming. Welcome to the various exchanges and discussions.
poj-3984
- poj 3984的ac代码-the code is accepted.
poj一些算法题的C++代码
- poj一些算法题的C++源码，已经通过测试，可以直接使用