
3613.CowRelays求经过n条边的最短路,floyd+倍增QAQ[crayon-6905234116b24388500484/]2728.DesertKing最优比率生成树分数规划[crayon-6905234116b3f493439736/]1639.PicnicPlanning带度数限制的最小生成树http://wenku.baidu.com/link?url=UKcnK1pZvaVwypQOrIFRTOPzM4edIlBmqvnZjZipGf2o_6u-aB1F2tFsMGdUQbA1O-96menmbgyxNoSoWKWBeJnr-RJKuG2yM4b6Jf7IvR3[crayon-6905234116b...

poj2245.Lotto裸搜索[crayon-690523411742c240359513/]poj2601.Simplecalculations推公式麻烦。。直接二分[crayon-690523411743a181533481/]poj1635.Subwaytreesystems树的同构,哈希[crayon-6905234117443468648500/]poj2419.Forests暴力即可[crayon-690523411744d462129583/]poj1717.Dominoesdp水题[crayon-6905234117457497850885/]poj2949.WordRings建图+分数规划[crayon-6905234117462863494180/] ...

DescriptionGordistrainingforamarathon.Behindhishouseisaparkwithalargenetworkofjoggingtrailsconnectingwaterstations.Gordwantstofindtheshortestjoggingroutethattravelsalongeverytrailatleastonce.InputInputconsistsofseveraltestcases.Thefirstlineofinputforeachcasecontainstwopositiveintegers:n<=15,thenumberofwaterstations,andm<1000,thenumberoftrails.Foreachtrail,thereisonesubsequentlineofin...

Givenaweighteddirectedgraph,wedefinetheshortestpathasthepathwhohasthesmallestlengthamongallthepathconnectingthesourcevertextothetargetvertex.Andiftwopathissaidtobenon-overlapping,itmeansthatthetwopathhasnocommonedge.So,givenaweighteddirectedgraph,asourcevertexandatargetvertex,weareinterestedinhowmanynon-overlappingshortestpathcouldwefindoutatmost.InputInputconsistsofmultipletestcases.Thefirs...
近期评论