csu and dsu

; -Right[i] = i+1; - } -RIGHT[M] =0; inCNT =0; - while(n--) to { +scanf"%d",flag); - if(Flag! =4) scanf ("%d%d",x,y); the Elsecnt++; * if((cnt1) flag3) flag =3-Flag; $ if(Flag = =1 left[y]!=x)Panax Notoginseng { - swap (left[x],right[x]); the swap (left[y],x); + swap (x, y); A } the Else if(Flag = =2 right[y]!=x) + { - swap (left[x],right[x]); $ swap (x,right[y]); $ swap (y,x); -

1611:concatenation time limit: 1 Sec Memory Limit: MB Submit: Solved: 4 [Submit] [Status] [Web Board] DescriptionZuosige always have bad luck. Recently, he is in hospital because of pneumonia. While he was taking his injection, he feels extremely bored. However, clever zuosige comes up with a new game.Zuosige writes some of he favorite strings on paper. And he wants to the find out a string which have all these favorite strings as its substrings. However, as a sick ma

Topic Link: Click to open the linkDescriptionGive a positive number, count the sum of the distinct subsequence of it, moreover, any subsequence should not contain leads ing zeroes except it is zero.For example, if the number was 1022, the answer is 1 + 0 + 2 + 10 + 12 + 22 + 102 + 122 + 1022 = 1293.InputThe first line had an integer T, means there is T test Cases.For each test case, there was only one line with a positive number, the number of the digits of it are in range [1, 105].The size of t

Topic Link: Click to open the linkTest instructionsGiven a long integerAll different sub-sequences and.Ideas:Dp[i] denotes the and of the sequence ending with the i numberNum[i] Indicates the number of sequences ending with an I numberImport Java.io.printwriter;import java.util.arraylist;import Java.util.arrays;import Java.util.Collections;import Java.util.comparator;import Java.util.iterator;import Java.util.linkedlist;import Java.util.PriorityQueue;import Java.util.scanner;import Java.util.tre

Test instructions: There is a row of n buildings each high uncertainty now to eliminate all buildingsThere are two ways to eliminate all blocks with a value of 1.2 elimination of an entire buildingAsk how to eliminate it with minimal stepsIdea: First sort the array from large to small if (I+a[i]#include 　　CSU 1578 Opening ceremony (recursive)

1663:tree time limit: 5 Sec Memory Limit: MB Submit: Solved: 11 [Submit] [Status] [Web Board] DescriptionCSU has a lot of trees. But there was a tree which is different from the others. This one was made of weighted edges and I had three kinds of operations on it:1. C a B:change the weight of edge A to B (1≤b≤100);2. M a B c:multiply the weights of those edges on the path from Node A to Node B by C (|c|≤10, c≠0);3. Q a b:get the sum of weights from all the edges on th

Topic Link: PortalTest instructionsThere are n points, M edges, to make all n points together and to spend the least, ask which side is necessary to connect.Analysis:To minimize the cost of making sure is to make the smallest spanning tree, but the topic requires which sides are necessary to use. We canTo think like this, we first ask for the smallest spanning tree and then count the edgesLift This n-1 the edges so they can't be used, and then continue to do the minimum spanning tree if the last

AI and water level bi for the flood of the first I, and count how many bridges have been flooded at least k times. The initial water level is 1, and the swollen water level of each flood must be greater than the water level of the last flood.InputThe input file contains up to 25 sets of test data. The first behavior of each group of data is three integers n, m, K (1OutputFor each set of data, output the number of bridges that have been flooded at least k times.Sample Input2 2 22 56 28 35 3 22 3

1328: Approximate palindrome word time limit:1 Sec Memory limit:128 MB submit:394 solved:144 [Submit] [Status] [Web Board] DescriptionInput a line of text, output the longest approximate palindrome word continuous substring. The so-called approximate palindrome refers to a string that satisfies the following conditions:1. s begins with a letter and ends with a letter2. A (s) and B (s) have a maximum of 2k positions, where a (s) is the string that s removes all non-alphabetic characters

Approximate return words Problem's link: http://acm.csu.edu.cn/OnlineJudge/problem.php? Id = 1328 Mean: . Analyze: Enumerate each end point in brute force mode, and then enumerate the radius of the input string. Time Complexity:O (N * m) Source code: // Memory Time// 1347K 0MS// by : Snarl_jsb// 2014-10-03-14.25#include 　　 String-approximate return word --- CSU 1328

Question link: http://acm.csu.edu.cn/OnlineJudge/problem.php? Id = 1333 Solution Report: There are n vertices and M unidirectional edges in a graph. Note that they are unidirectional edges, and then turn off B s for a second for each drive, the shortest time from S to T. A simple Shortest Path changes slightly. It took a long time because the side was not seen as one-way side and speechless. You can use queue optimization. 1 # include View code CSU 1

label: style blog HTTP color Io OS AR for sp 题目链接：http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1116 解题报告：一个国家有n个城市，有m条路可以修，修每条路要一定的金币，现在这个国家只有K个金币，每个城市有一些人，要你求怎么修路使得总的费用在K的范围内，同时使得跟首都连接的城市的人口（包括首都的人口）要最多，问最多的人口是多少。 枚举连接哪些城市，然后分别构造最小生成树。 1 #includeView Code CSU 1116 Kingdoms（枚举最小生成树）

CSU 1563: Lexicography (mathematical counting problem), csulexicography 1563: LexicographyTime Limit: 1 Sec Memory Limit: 128 MB Submit: 342 Solved: 111 [Submit] [Status] [Web Board] Description An ansible of a string is any string that can be formed using the same letters as the original. (We consider the original string an anal of itself as well .) for example, the string ACM has the following 6 anagrams, as given in alphabetical order: ACMAM

CSU 1319 CX's dreams maximum number of vertices obtained from the right closure Graph Question link: Click the open link Ideas: Obviously, this is to ask the maximum right closure graph and the number of vertices that can obtain the most. 1. First of all, the payment for the positive value is taken directly, and the payment for the positive value is ignored for the dream. In this way, the payment is converted into a bare maximum weight closure diagram

The first time I got into touch with this longest public ascending subsequence However, we have figured out exactly the same as the longest common subsequence and the longest ascending subsequence. For a duplicate loop, if the current one is not equal, it is equal to the value of the previous one. If it is equal, it is equal to the maximum value + 1 smaller than the current A [I. Get the maximum value of a temporary variable record. #include 　　 Longest Common ascending sub-sequence of ultraviol

The difficulty of the provincial competition in the year before was that the stone was not well handled. Later I read the summary of Yang Shen's provincial competition and found that this stone is here, because there are only four or five sub-members, it is enough to deal with violent DFS. First, we regard the stone as a common obstacle, perform a full graph of DFS or BFs, find the available points, and then each time the DFS explores a new point in a new area, we can figure it out. #include V

BFS + DFS Complex search questions. Because the data is small, there are up to five rock databases, up to 10 coin databases, and up to 4 ^ 5 = 1024 states for moving rock; Ideas: Take the coin that can be obtained in the current status and set the current location of the map to '.' (the location of the coin to be removed is empty) After coin is taken away, you can search for it once. When rock is found to determine whether it can be pushed, you can create a new map and set the Rock Point '. '(nu

Description Select the leftmost Number of the sequence, and insert it to any position in the sequence. The number of times that the above operation must be repeated at least to change the sequence to an incremental sequence. The first line of input contains an integer. T( T> 0), indicating a total TGroup test data. For each group of test data, the first row contains an integer. N(1 ≤ N≤ 105), indicating a total NInteger. The second line contains NDifferent integers (all of which are in the range

) are considered as two different sequential number pairs! Sample Input 6 38 815 3213 77Sample output 58 1423 10883 24Hint For 64-bit integer types, use LLD, or CIN, cout. T_t Csu_scsi This is the question of last year's competition. At that time, I felt it was difficult to implement it with Euler. Later, I learned to use the Mobius Inversion, but it has timed out. Whether the block is used or time-out. Question: omitted Idea: For the second type, direct (A/P) * (B/P) is the answer. It is no

Is ...... Determine that the intersection of the link between P and the center of the circle is not on the arc, that is, the distance from P to P, or the shortest distance between P and the endpoint. #include CSU 1503: distance from point to arc-computing program design competition for the tenth college student in Hunan Province