smalltian - 博客园

2012年11月25日

摘要：最小生成树的题目，深刻理解最小生成树算法以后这道题目不算很难。用的是prim算法。把已经建好路的村庄dis置为0，这样的话最小生成树的边一定会有这几条已建好的路，从没有建好的路的村庄开始生成。（在很多情况下要置辅助数组lowcost为MAX，但是这道题目不用） 1 #include<iostream> 2 using namespace std; 3 int dis[100][100]; 4 int v1,v2; 5 int lowcost[100]; 6 int needroad; 7 int N; 8 void prim() 9 {10 int i,j;11 for(i=0.. 阅读全文

posted @ 2012-11-25 10:36 smalltian 阅读(654) 评论(0) 推荐(0)

2012年11月23日

HDU 4403

摘要： A very hard Aoshu problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 454 Accepted Submission(s): 321 Problem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for pri. 阅读全文

posted @ 2012-11-23 20:26 smalltian 阅读(190) 评论(0) 推荐(0)

HDU 3699

摘要： HDU 3699A hard Aoshu ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 62768/32768 K (Java/Others) Total Submission(s): 548 Accepted Submission(s): 271 Problem DescriptionMath Olympiad is called “Aoshu” in China. Aoshu is very popular in elementary schools. Nowadays, Aoshu is getting more 阅读全文

posted @ 2012-11-23 13:50 smalltian 阅读(209) 评论(0) 推荐(0)