搜索资源列表
C
- ACM/ICPC-2016年C题,代码能通过样例输入输出,但是效率较低,没有通过测评网站验证。期待更高效的代码。-ACM/ICPC- 2016 Question C code. input and output passed the sample I/O, but less efficient, site verification does not pass the uation. Expect more efficient code.
problem
- 回溯法解决ACM题目“旅行商问题”的c++源代码-Backtracking to solve the ACM topic " traveling salesman problem" c++ source code
src
- ACM题目用优先队列法解决0-1背包问题c++源代码-ACM topic with priority queuing method to solve 0-1 knapsack problem c++ source code
杭电oj5700
- 杭电oj5700Accept代码 百度之星初赛题 有n个非负整数的数列与m个区间。每个区间可以表示为li,ri。 选择其中k个区间, 使得这些区间的交的那些位置所对应的数的和最大。 链接:http://acm.hdu.edu.cn/showproblem.php?pid=5700(Hang dian oj 5700 Accept code. Baidu star preliminary contest. There are n non-negative integers and m