Welcome![Sign In][Sign Up]
Location:
Search - acm.hdu.edu.cn

Search list

[Other resourcetwo_directon_BFS

Description: 双向BFS搜索算法,是针对acm.hdu.edu.cn上1401题所实现的代码,效率非常高。
Platform: | Size: 1304 | Author: sinamaster | Hits:

[Other resourceVol10

Description: HDOJ acm.hdu.edu.cn 第10卷的一些题目,有些提供数据,有简单的分析过程
Platform: | Size: 179697 | Author: 黄魏 | Hits:

[Data structs1052TianJiTheHorseRacing

Description: ACM HDOJ http://acm.hdu.edu.cn/showproblem.php?pid=1052-ACM HDOJ http :// acm.hdu.edu.cn/showproblem.php pid = 1052
Platform: | Size: 1024 | Author: sxb | Hits:

[Data structs1056HangOver

Description: HDOJ acm 1056HangOver http://acm.hdu.edu.cn/showproblem.php?pid=1056-HDOJ acm 1056HangOver http :// acm.hdu.edu.cn/showproblem.php pid = 1056
Platform: | Size: 46080 | Author: sxb | Hits:

[AI-NN-PRtwo_directon_BFS

Description: 双向BFS搜索算法,是针对acm.hdu.edu.cn上1401题所实现的代码,效率非常高。-Bi-directional BFS search algorithm is acm.hdu.edu.cn on the 1401 title by the realization of the code is highly efficient.
Platform: | Size: 1024 | Author: sinamaster | Hits:

[Data structsVol10

Description: HDOJ acm.hdu.edu.cn 第10卷的一些题目,有些提供数据,有简单的分析过程-HDOJacm.hdu.edu.cn Vol.10 some of the topics, and some provide data, has a simple analytical process
Platform: | Size: 179200 | Author: 黄魏 | Hits:

[Data structslcs

Description: 一道经典的动态规划题目 浙江大学硕士生入学复试上机题 http://acm.hdu.edu.cn/showproblem.php?pid=1231-Classic dynamic programming http://acm.hdu.edu.cn/showproblem.php?pid=1231
Platform: | Size: 1024 | Author: 陈子杭 | Hits:

[Mathimatics-Numerical algorithmshdu1043eight

Description: 八数码问题 里面有hdu1043题目和代码 题目链接为http://acm.hdu.edu.cn/showproblem.php?pid=1043 -8 digital issues and code inside hdu1043 topic subject links to http://acm.hdu.edu.cn/showproblem.php?pid=1043
Platform: | Size: 48128 | Author: herolilong | Hits:

[Windows Develophdu1020

Description: Hdu 1020解题报告,http://acm.hdu.edu.cn/showproblem.php?pid=1020
Platform: | Size: 55296 | Author: 罗跃 | Hits:

[Windows DevelopHDU1026

Description: HDU1026题目的题目代码 这是道记忆化搜索题 要输出搜索路径的 网址是:http://acm.hdu.edu.cn/showproblem.php?pid=1026-HDU1026 topic subject code is Road to the output memory search title search path of URLs is: http://acm.hdu.edu.cn/showproblem.php?pid=1026
Platform: | Size: 1024 | Author: 郭东山 | Hits:

[Data structsacm_hdu_2045

Description: 杭电 不容易系列之(3)—— LELE的RPG难题 题解 http://acm.hdu.edu.cn/showproblem.php?pid=2045-HDU ACM program for No.3 LELE s RPG problem
Platform: | Size: 1024 | Author: dfg03hap2 | Hits:

[Mathimatics-Numerical algorithms1000-1010

Description: 大数相加。杭电ACM1000-1010题 http://acm.hdu.edu.cn/listproblem.php?vol=1-Add large numbers. Hangzhou Xinhua ACM1000-1010 title http://acm.hdu.edu.cn/listproblem.php?vol=1
Platform: | Size: 6144 | Author: squirrel | Hits:

[Othercode

Description: The 35th ACM/ICPC Asia Regional Chengdu Site —— Online Contest B-number http://acm.hdu.edu.cn/showproblem.php?pid=3652
Platform: | Size: 8192 | Author: Warren | Hits:

[Mathimatics-Numerical algorithms1026

Description: 杭电ACM-ICPC 1026 http://acm.hdu.edu.cn/-hdu ACM-ICPC 1026 http://acm.hdu.edu.cn/
Platform: | Size: 2048 | Author: 夜未央 | Hits:

[Other3339

Description: HDOJ 3339 AC代码 链接:http://acm.hdu.edu.cn/showproblem.php?pid=3339-HangZhouDianZi University OnlineJudge. The Accepted code of the Problem 3339 . link:http://acm.hdu.edu.cn/showproblem.php?pid=3339
Platform: | Size: 1024 | Author: 马彬 | Hits:

[Data structshdu-3491-Thieves

Description: hdu 3491 源码, 源地址http://acm.hdu.edu.cn/showproblem.php?pid=3491-hdu 3491 source code, source address http://acm.hdu.edu.cn/showproblem.php?pid=3491
Platform: | Size: 2048 | Author: hs | Hits:

[Driver Developcode109

Description: The 35th ACM/ICPC Asia Regional Chengdu Site —— Online Contest B-numberhttp://acm.hdu.edu.cn/showproblem.php?pid=3652
Platform: | Size: 8192 | Author: mw08879 | Hits:

[Algorithm杭电oj5700

Description: 杭电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 intervals. Each interval can be expressed as li,ri. Choose the k interval, so that the number of those positions corresponds to the number and the maximum. Link:http://acm.hdu.edu.cn/showproblem.php?pid=5700)
Platform: | Size: 3731456 | Author: 钢琴海盗 | Hits:

CodeBus www.codebus.net