2012-summer-Training-Contest(4)
所属分类：数据结构
开发工具：C/C++
文件大小：212KB
下载次数：2
上传日期：2012-11-16 04:50:41
上 传 者：
j_lenmo
说明： ACM 2012多校暑假集训（4），标程+解题报告。
(ACM 2012 Multi-University Training Contest- Contest 4 Tutorial.)
文件列表:
1001-BIT-A\solution\A_solution.docx (15094, 2012-06-09)
1001-BIT-A\source\A.cpp (2694, 2012-06-09)
1002-BIT-B\check_hh.cpp (1899, 2012-08-01)
1002-BIT-B\check_hh.exe (106112, 2012-08-01)
1002-BIT-B\check_hh.o (90211, 2012-08-01)
1002-BIT-B\data.out (135, 2012-08-01)
1002-BIT-B\problem.docx (21979, 2012-06-09)
1002-BIT-B\solution.docx (15146, 2012-06-09)
1002-BIT-B\standard.cpp (3002, 2012-06-09)
1003-BIT-D\solution\D_solution.docx (17387, 2012-06-09)
1003-BIT-D\source\D.cpp (1095, 2012-06-09)
1004-Hadi-5sum\5sum.cpp (1031, 2012-07-22)
1004-Hadi-5sum\problem-statement.txt (821, 2012-07-22)
1004-Hadi-5sum\problem.doc (23552, 2012-08-01)
1004-Hadi-5sum\solution-sketch.txt (664, 2012-07-22)
1005-AekdyCoin-What is N\Problem.docx (26404, 2012-08-01)
1005-AekdyCoin-What is N\solution.docx (36993, 2012-07-29)
1005-AekdyCoin-What is N\standard_0.cpp (2405, 2012-08-01)
1006-TJU-collector_spj\collector_spj.cpp (784, 2012-07-09)
1006-TJU-collector_spj\forcecode.cpp (1288, 2012-07-08)
1006-TJU-collector_spj\makedata.cpp (1228, 2012-07-13)
1006-TJU-collector_spj\problem.doc (14336, 2012-07-09)
1006-TJU-collector_spj\solution.doc (25088, 2012-07-13)
1006-TJU-collector_spj\standard.cpp (900, 2012-07-13)
1007-TJU-knight_spj\knight_spj.cpp (1528, 2012-07-01)
1007-TJU-knight_spj\makedata.cpp (1225, 2012-07-13)
1007-TJU-knight_spj\problem.doc (16384, 2012-07-07)
1007-TJU-knight_spj\solution.doc (26624, 2012-07-13)
1007-TJU-knight_spj\standard.cpp (1765, 2012-07-13)
1008-totalfrank-Simple Path\makedata.cpp (2087, 2012-07-21)
1008-totalfrank-Simple Path\Problem.docx (17591, 2012-07-21)
1008-totalfrank-Simple Path\solution.docx (15354, 2012-07-17)
1008-totalfrank-Simple Path\standard_0.cpp (6836, 2012-07-21)
1008-totalfrank-Simple Path\standard_1.cpp (5417, 2012-07-21)
1009-乌克兰--problem_1_upd\brute.cpp (3004, 2012-07-08)
1009-乌克兰--problem_1_upd\gen.cpp (5264, 2012-07-08)
1009-乌克兰--problem_1_upd\solution.cpp (3932, 2012-07-08)
1009-乌克兰--problem_1_upd\solution_desc.txt (861, 2012-07-07)
1009-乌克兰--problem_1_upd\statement.txt (1102, 2012-07-29)
... ...
标程中求解割点与双联通使用了递归，由于数据规模较大，并且手动出了一条链的数据。在windows上会爆栈，代码是在linux上测试的。
如果HDOJ上会爆栈的话，可以考虑将makedata中n = 80000, m = 79999, q = 3000这组数据改成n = 60000, m = n - 1, q = 3000后生成数据再测试。调整到不会爆栈的最大规模即可。
近期下载者：
相关文件：
收藏者：