messyidea的专栏

tarjan /***********************************************\ |Author: YMC |Created Time: 2014/5/10 22:36:04 |File Name: tarjan.cpp |Description: \***********************************************/ #in

Description "Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story.  "Prince Remmarguts lives in

"The instructions to turn always to the left reminded me that such was the common procedure for discovering the central courtyard of certain labyrinths." in The garden of forking paths by Jorge Lui

Description Christmas is coming to KCM city. Suby the loyal civilian in KCM city is preparing a big neat Christmas tree. The simple structure of the tree is shown in right picture. The tree can

Your city has n junctions. There are m one-way roads between the junctions. As a mayor of the city, you have to ensure the security of all the junctions. To ensure the security, you have to build s

测试数据： 8 0 2 8 1 0 0 0 0 2 0 6 0 1 0 0 0 8 6 0 7 5 1 2 0 1 0 7 0 0 0 9 0 0 1 5 0 0 3 0 8 0 0 1 0 3 0 4 6 0 0 2 9 0 4 0 3 0 0 0 0 8 6 3 0 8个点，矩阵m[i][j]代表i与j的距离。 kruskal 所有边按长度从小到大排序，如果边的两点

Battle ships Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 52    Accepted Submission(s): 28 Problem Description Dear contestant,