随笔分类 - 最小生成树/最小树形图
Kruskal算法、Prim算法、朱刘算法
    
摘要:Install Air ConditioningTime Limit: 2000msMemory Limit: 65535KBThis problem will be judged onHDU. Original ID:475664-bit integer IO format:%I64d Java ...
        阅读全文
                
摘要:Two Famous CompaniesTime Limit: 15000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:425364-bit integer IO format:%I64d Java cla...
        阅读全文
                
摘要:D -KingdomsTime Limit:1000MSMemory Limit:0KB64bit IO Format:%lld & %lluA kingdom has n cities numbered 1 to n, and some bidirectional roads connecting...
        阅读全文
                
摘要:Fibonacci TreeTime Limit: 2000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:478664-bit integer IO format:%I64d Java class name...
        阅读全文
                
摘要:ConscriptionTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged onPKU. Original ID:372364-bit integer IO format:%lld Java class name:Ma...
        阅读全文
                
摘要:Absurdistan RoadsTime Limit: 5678/3456MS (Java/Others) Memory Limit: 65432/65432KB (Java/Others)The people of Absurdistan discovered how to build roa...
        阅读全文
                
摘要:畅通工程Time Limit: 1000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:186364-bit integer IO format:%I64d Java class name:Main省政府“畅...
        阅读全文
                
摘要:继续畅通工程Time Limit: 1000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:187964-bit integer IO format:%I64d Java class name:Main省政府...
        阅读全文
                
摘要:还是畅通工程Time Limit: 2000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:123364-bit integer IO format:%I64d Java class name:Main某省调...
        阅读全文
                
摘要:Jungle RoadsTime Limit: 1000msMemory Limit: 10000KBThis problem will be judged onPKU. Original ID:125164-bit integer IO format:%lld Java class name:Ma...
        阅读全文
                
摘要:HighwaysTime Limit: 1000msMemory Limit: 65536KBThis problem will be judged onPKU. Original ID:248564-bit integer IO format:%lld Java class name:MainTh...
        阅读全文
                
摘要:Truck HistoryTime Limit: 2000msMemory Limit: 65536KBThis problem will be judged onPKU. Original ID:178964-bit integer IO format:%lld Java class name:M...
        阅读全文
                
摘要:畅通工程再续Time Limit: 1000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:187564-bit integer IO format:%I64d Java class name:Main相信大...
        阅读全文
                
摘要:Agri-NetTime Limit: 1000msMemory Limit: 10000KBThis problem will be judged onPKU. Original ID:125864-bit integer IO format:%lld Java class name:MainFa...
        阅读全文
                
摘要:Red/Blue Spanning TreeTime Limit: 2000msMemory Limit: 131072KBThis problem will be judged onHDU. Original ID:426364-bit integer IO format:%I64d Java c...
        阅读全文
                
摘要:H. Qin Shi Huang's National Road SystemTime Limit: 1000msMemory Limit: 32768KB64-bit integer IO format:%I64d Java class name:MainDuring the Warring St...
        阅读全文
                
摘要:F. HighwaysTime Limit: 1000msMemory Limit: 10000KB64-bit integer IO format:%lld Java class name:MainThe island nation of Flatopia is perfectly flat. U...
        阅读全文
                
摘要:修路方案时间限制:3000ms | 内存限制:65535KB难度:5描述南将军率领着许多部队,它们分别驻扎在N个不同的城市里,这些城市分别编号1~N,由于交通不太便利,南将军准备修路。现在已经知道哪些城市之间可以修路,如果修路,花费是多少。现在,军师小工已经找到了一种修路的方案,能够使各个城市都联通...
        阅读全文
                
摘要:The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:19847Accepted:6959DescriptionGiven a connected undirected graph, tell if its minim...
        阅读全文
                
摘要:布线问题时间限制:1000ms | 内存限制:65535KB难度:4描述南阳理工学院要进行用电线路改造,现在校长要求设计师设计出一种布线方式,该布线方式需要满足以下条件:1、把所有的楼都供上电。2、所用电线花费最少输入第一行是一个整数n表示有n组测试数据。(n 2 #include 3 #incl...
        阅读全文
                

 浙公网安备 33010602011771号
浙公网安备 33010602011771号