Problem G Time Limit : 6000/2000ms (Java/Other)   Memory Limit : 65535/16384K (Java/Other)Total Submission(s) : 56   Accepted Submission(s) : 19Font: <span onclick="function onclick(){functi

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1166 我的代码：/*  * File:   main.cpp * Author: mtttt * * Created on 2010年3月14日, 下午3:11 */#include #include #include using namespace std;typedef struc

题目链接地址：http://acm.hdu.edu.cn/showproblem.php?pid=1251 如给定字符串集合abcd,abd,cdd,efg,hij,hi六个字符串建立的trie tree如下图所示:    代码： #includeusing namespace std;const int kind=26;//字母种类struct Treenode/

<br />网址：http://acm.hdu.edu.cn/showproblem.php?pid=3460Ancient Printer<br />Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)<br />Total Submission(s): 289    Accepted Submission(s): 132<br /><br />Problem DescriptionThe

Language of FatMouseTime Limit: 10 Seconds      Memory Limit: 32768 KB We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him. Input Specification

<br />链接地址：http://acm.hdu.edu.cn/showproblem.php?pid=3405<br /> <br />题目意思是找一个MST，但是不是n个点的，是n-1个点的，另一个点孤立<br /> <br />我是把n个点，每一个点都孤立一次，算出所有的MST的最短路径，最后找出最小值<br /> <br />代码#include <cstdlib>#include <cmath>#include <algorithm>#include <vector>#inclu