tjqACM的专栏

D. Choosing Capital for Treeland time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output The country Treeland consi

题意：给你一个01串，现在让你将他简称几段，是的每段每段串01不交替出现且长度不超过k，01不交替即（1010,0101）不符合，但（10100,00101）是符合的，问你最少剪多少刀，使得每段符合要求 解题思路：用dp[i],表是在第i各位字后面剪一刀的时的最小剪的次数，转移即为dp[i]=dp[j]+1,如果j 到 i的满足条件                  否则dp[i]=dp[j]

C. Barcode time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You've got an n × m pixel picture. Each pixel ca

D. Caesar's Legions time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Gaius Julius Caesar, a famous general,

B. The least round way time limit per test 5 seconds memory limit per test 64 megabytes input standard input output standard output There is a square matrix n × n, consi

C. Another Problem on Strings time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A string is binary, if it con

C. Present time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Little beaver is a beginner programmer, so infor

D. Mysterious Present time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output Peter decided to wish happy birthday t

C. Color Stripe time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A colored stripe is represented by a horizo

B. Color the Fence time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Igor has fallen in love with Tanya. Now

题目大意：给你一个无向图，问我们最多加一条边使得图的桥的数量最小，输出最小数量 解题思路：先将图缩点，我们就得到一个无环图，然后我们只需找到最长链，将其首尾相连即可减少对多的桥，减少的数量为链的长度，即树的直径。（ps：注释部分为并查集缩点） 代码：//#pragma comment(linker, "/STACK:1024000000,1024000000") #include #inclu