qvce4elbFrsc
uva10714Ants Anarmyofantswalkonahorizontalpoleoflengthlcm,eachwithaconstantspeedof1cm/s.Whenawalking...
uva10600ACMContestandBlackout 题目大意：给你一张图，求最小生成树和次小生成树。 解题思路：次小生成树。 include<cstdio> include<cstring> include<algorithm> include<cmath> include<cstdlib> usingnamespacestd; typedeflonglongll; constintN=105; constintINF=0x3f3f3f3f; intn,m; boolvis[N],used[N][N]; intpre[N...
uva10740NottheBest 题目大意：求第K短路。 解题思路：A算法。这题数据量比较小，也可以暴力。 A算法 include<cstdio> include<cstring> include<algorithm> include<cmath> include<cstdlib> include<queue> usingnamespacestd; typedeflonglongll; constintN=105; constintINF=0x3f3f3f3f; intn,m; ints,t,K; inth[N]...
uva10453MakePalindrome 题目大意：给出一段字符串，要求求出最少加入几个字符（任意位置），可以让该字符串变成会问字符串，并输出修改以后的回文字符串。 S[i]S[j],dp[i][j]=dp[i+1][j−1]当S[i]!=S[j],dp[i][j]=min(dp[i+1][j],dp[i][j−1])+1,在DP的过程中记录对该区间的操作类型，最后递归输出。 include<cstdio> include<cstring> include<algorithm> include<cmath> include<cstd...
ACDREAM03CRobbers ProblemDescription Nrobbershaverobbedthebank.AstheresultoftheircrimetheychancedtogetMgoldencoins.Beforetherobberythebandhasmadeanagreementthataftertherobberyi-thgangsterwouldgetXi/Yofallmoneygained.However,itturnedoutthatMmaybenotdivisiblebyY. Theproblemwhichnowshouldbesolvedbyr...
uva10970BigChocolate BigChocolate MohammadhasrecentlyvisitedSwitzerland.Asheloveshisfriendsverymuch,hedecidedtobuysomechocolateforthem,butasthisfinechocolateisveryexpensive(YouknowMohammadisalittleBITstingy!),hecouldonlyaffordbuyin...
uva216 GettinginLine Computernetworkingrequiresthatthecomputersinthenetworkbelinked. Thisproblemconsidersa``linear"networkinw...
uva10700 Cameltrading Background Aroud800A.D.,ElMamum,CalifofBaghdadwaspresentedtheformula1+234+5,whichhadi...
uva11324TheLargestClique 题目大意：给出一个有向图，要求出该图中的最大结点集。结点集满足下列条件，结点集中的每两个点u,v，要么u可以到达v，要么v可以到达u，要么互相可达。 解题思路：在原图的基础上，先求一次强连通分量。然后把每个强连通分量都缩成点之后，可以得到一个有向无环图，然后可以用dp，求出最大嵌套。 include<cstdio> include<cstring> include<algorithm> include<cmath> include<cstdlib> include<stack...
uva10025The?1?2?...?n=kproblem Theproblem Giventhefollowingformula,onecansetoperators'+'or'-'insteadofeach'?',inordertoobtainagivenk?1?2?...?n=k Forexample:toobtaink=12,theexpressiontobeusedwillbe:1+2+3+4+5+67=12withn=7 TheInput Thefirstlineisthenumberoftestcases,followedbyablankline. Eachtestcaseo...
uva350Pseudo-RandomNumbers Computersnormallycannotgeneratereallyrandomnumbers,butfrequentlyareusedtogeneratesequencesofpseudo-randomnumbers.Thesearegeneratedbysomealgorithm,...