题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-681d768c26b38400771453/]POJ2112OptimalMilking[crayon-681d768c26b53405336467/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-681d768c26b62376587004/]POJ1269IntersectingLines[crayon-681d768c26b6e926445361/]POJ1569MyacmTriangles[crayon-681d768c26b75323822572/]POJ1039Pipe[crayon-681d768c26...
poj1961Periodkmp求出fail数组后,前i个的重复子串就是i-fail(i)[crayon-681d768c2c419915367544/]poj1276 CashMachine用f(i,j)表示前i种面值,达到j的面值和,所需要的第i种钞票的最少数量[crayon-681d768c2c428118318181/]poj1702 Eva'sBalance先把n转为3进制,若p位为2,就在左盘放3^p,进位若p位为1,就在右盘放3^p[crayon-681d768c2c432976892660/]poj1273 DrainageDitches大名鼎鼎的草地排水,网络流模板[crayon-6...
DescriptionThecityexecutiveboardinLundwantstoconstructasightseeingtourbybusinLund,sothattouristscanseeeverycornerofthebeautifulcity.Theywanttoconstructthetoursothateverystreetinthecityisvisitedexactlyonce.Thebusshouldalsostartandendatthesamejunction.Asinanycity,thestreetsareeitherone-wayortwo-way,trafficrulesthatmustbeobeyedbythetourbus.Helptheexecutiveboardanddetermineifit'spossibletocons...
Givenaweighteddirectedgraph,wedefinetheshortestpathasthepathwhohasthesmallestlengthamongallthepathconnectingthesourcevertextothetargetvertex.Andiftwopathissaidtobenon-overlapping,itmeansthatthetwopathhasnocommonedge.So,givenaweighteddirectedgraph,asourcevertexandatargetvertex,weareinterestedinhowmanynon-overlappingshortestpathcouldwefindoutatmost.InputInputconsistsofmultipletestcases.Thefirs...
近期评论