Others

/* Use a weight scale to calculate the weight. The weight value can be negative Based on the right code of the left object. Because the maximum weight is one,Therefore, you are not allowed to use k in a general template as a heavy loop. The number

This question should be a question of water, but I am more than a question of water... TT, written in map, the corresponding Roma number is saved incorrectly... Just in the competition, I was dizzy, WA twice, and my ranking... TT #include #include

Linked List Implementation: Struct Node{Int V; // The ending vertex of an edge.Int W; // edge LengthNode * Next; // pointer to the next edge at the same starting point} * First [N]; // first [u] points to the first edge starting from U.Void Init

Tangle of high precision, finally won... The transfer equation is very simple DP [I] [J] = DP [I-1] [J-K] {k | 0, 1, 2 ...., 9}, high precision all afternoon. Tragedy, various wa... I tried it again and finally it was over. #include #include

In the past two days, we have been engaged in the development of DP and want to learn about the network stream. Take the computation guide to check whether the shortest path is complete. Write a Kruskal algorithm that uses and queries set

　 /* I feel that my practice is very troublesome. One can only store +-symbol arrays, one can store all operators in the queue, and the other one.Queue storage operations (such as 1011, 10.11 )). And then brute force search... *//* My code: 297 Ms */

Recently I started the game theory, which is in the initial entry stage. I found a few questions to do this. This is a deformation of the NIM game. The distance between two coordinates is considered as the number of stones in a pile of stones, and N

Similar to Fibonacci again and again It seems a bit like a template, that is, I don't know how to calculate the upper bound of the hash array. I'm speechless. Continue to study... #include #include using namespace std;const int N = 10010;const int

This topic is similar to the topic with the longest ascending suborder. At the beginning, I wanted to do it with greed, but the tragic question did not even give data. Later I thought about DP, Because I recently looked at my backpack and had a

/* You can use and check the set, but it is awkward. Graph Theory. Today, I saw this in my brother's blog.Solution: Use two parts to limit the weight of the obtained edge. Set the maximum and minimum deviation to Lim, and the minimum to low. So low

I wrote a whole day, and I had a sample in the evening. Then there were various wa, TLE, Ole !!! Code: #include #include #include using namespace std;const int N = 11;char map[N][N];int hr[N][N];int hc[N][N];int hx[3][3][N];int z;void dfs(int i, int

/* I wrote the dinic wrong last night. I couldn't get the result and didn't call it out. Before I went to bed, I suddenly remembered it.A break causes an endless loop. Change the location to WA Today. Then I knocked on it again, TLE.I checked it

Find a regular question. The rule is as follows: 2 -- 9 N-Position 10 -- 9*2 P-Position 19 -- 9*2*9 N 9*2*9 + 1 -- 9*2*9*2 P 9*2*9*2 + 1 -- 9*2*9*2*9 N . . . Train of Thought: divide the input number by 18. When the obtained number N is

This question lasted for nearly a month, and I checked my backpack intermittently. Today, I read the first three lectures in my backpack's nine lectures in one breath. This is a typical multi-bag problem: the I-th item has n [I] types, and the

/* This question should belong to the water question. There is basically no need to deal with it. Just read the question. Directly n DFS times to find the maximum length */// My code: 16 Ms# Include # Include # Include Using namespace STD;Const int

The first way I got this question was to play the opposite game with Nim, and then I didn't know how to do it. Then I asked Daniel, and Daniel's answer was very concise: "anit-nim, national training team paper ". Then I flipped through my papers for

An Analysis of the Use Case-driven demand management (RUP) is short for the Rational Unified Process. It is a software process product launched by rational (now owned by IBM. From the perspective of the software process model, RUP is a typical

The lightweight Unix "Get and get" (Part 1) 3. Users who use Windows systems with commands related to searching and comparison may have such experiences. On the internet, they can see long-winded movies, down, and ingenious e-books; let's see the

The lightweight Unix "Get and get" (Part 2) VI. The concept of "functional illiteracy" in commands related to network communication was first proposed by UNESCO at the Conference of Ministers of Education held in Tehran, Iran on 1965, it initially

The question is to give an origin coordinate, and then give n coordinate points. Each point has a brick and requires that the n bricks be moved to the origin. A maximum of two parts can be moved at a time, and the time used to take a path is the