题目来源:http://dapractise.openjudge.cn/2019hwall/POJ3436ACMComputerFactory[crayon-647670c7f2bc7402220897/]POJ2112OptimalMilking[crayon-647670c7f2bda845848545/]POJ1274ThePerfectStall用邻接矩阵写的[crayon-647670c7f2be3331793901/]POJ1269IntersectingLines[crayon-647670c7f2be9074753751/]POJ1569MyacmTriangles[crayon-647670c7f2bed038277693/]POJ1039Pipe[crayon-647670c7f2...
poj1961Periodkmp求出fail数组后,前i个的重复子串就是i-fail(i)[crayon-647670c801fab275638839/]poj1276 CashMachine用f(i,j)表示前i种面值,达到j的面值和,所需要的第i种钞票的最少数量[crayon-647670c801fc4773056167/]poj1702 Eva'sBalance先把n转为3进制,若p位为2,就在左盘放3^p,进位若p位为1,就在右盘放3^p[crayon-647670c801fca634918578/]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...
近期评论