C++

The question is to judge whether two graphs are homogeneous, that is, whether the two graphs are the same. Because the graph of the question is very special and the degree can only be 2, the graph is composed of several links, or several rings, that

Continue IDA * search, and the valuation function H is still the Manhattan distance. Each conversion will change the Manhattan distance in four locations by 1, therefore, the Manhattan distance and + 3/4 can be used as the H function to indicate at

The starting status and target status have been determined, and there are many statuses, which can be done in two-way BFS, but the path needs to be recorded, the Code is not easy to write, and it takes more time.We learned preprocessing from Amb's

Question: give you a forest with n nodes and m edges, and then specify q queries. Each time you query the nearest distance between the two vertices in the forest. N, m Solution: A very classic LCA is actually a very simple LCA question, but this

A person's travel, or dijkstra, but remember to build grass number 0 to the length of the edge of the adjacent city is 0. Code [Cpp]# Include Using namespace std;Const int INF = 0x7fffffff;Int dist [2005], map [2005] [2005];Bool visit [2005];Int

I caught a cold today, but it was really unfortunate to catch a cold on a hot day, but this question is very obedient. The Tarjan algorithm was used to implement offline inquiry. Previously, a blog was recommended for the LCA algorithm. For example,

[Cpp]# Include # Include # Include # Include # Include # Include # Include Using namespace std;Int main (){Int t;Scanf ("% d", & t );String str;While (t --){Map M;Cin> str; For (int I = 0; I {Char p = str [I];Int kk = 0;While (++ I I --;If (kk = 0){

It was relatively simple to use a line segment tree N years ago. It can be used as an exercise for lazy marking a line segment tree.Using the Splay tree again makes a little fuss, and the code is long and the efficiency is low, but it is good to use

 It is also the forward traversal of the Binary Search Tree. 1. Tree creation will affect the shape of the entire tree in sequence2. Remember to release resources3. You can use double pointers and reference optimizers .. Some printf () in the Code

[Cpp]# Include # Include # Include # Include # Include Using namespace std;Double random (){Return (double) rand ()/RAND_MAX ;}Int random (int m){Return (int) (random () * (m-1) + 0.5 );}Int n, m;Void in (int &){Char ch;While (ch = getchar () '9 ');

There is a problem:Is a parent class written with a virtual function? Can a sub-class overwrite its functions without the virtual function realize polymorphism?The general answer is also polymorphism. Some people say that virtual modifiers are

In the introduction to algorithms, the reference element is selected as the final one, and the data structure textbook I used is the first;However, the principle is the same. The elements in array a are divided into three parts by using the Qartion (

Question: calculate the number of public substrings with a length not less than k. The practice is to maintain a monotonous stack. For more information, see the thesis. [Cpp]# Include # Include # Include # Include # Include # Include # Include #

Ac .. Good questions ..# Include # Include # Include # Include # Include # Include # Include # Include # Include # Include # Include # Include # Include Using namespace std; # Ifdef _ WIN32# Define i64 _ int64# Define out64 "% I64d \ n"# Define in64

Type: Sort There are lots of number games for children. these games are pretty easy to play but not so easy to make. we will discuss about an interesting game here. each player will be given N positive integer. (S) He can make a big integer by

String simulation, enumerating the full arrangement of your own and your opponent's cards [Cpp]# Include # Include # Include # Include Using namespace std;Int map [10] [10];Char str [10] [25];Int a [10], B [10];Int n, flag;Int check (int a [10], int

Question: give you the volume and quantity of n items, and ask you how many combinations can be filled with a backpack of MB size.I have been thinking about how to use a one-dimensional array for a long time.Therefore, after returning to the General

Segment update and discretization line segment tree This question is almost a day .... Various problems: I didn't add the queried nodes to the tree when I started to build the tree. The results showed that the information of many nodes was lost

N dice. Each dice has k faces and the numbers are 1 ~ KQ: There are several solutions to add the Top n digits of n dice to S.We can think of such a DP.Dp [I] [j] indicates the sum of the first I dice and the total number of solutions when the sum is

Description"Good man never makes girls wait or breaks an appointment! "Said the mandarin duck father. Softly touching his little ducks 'head, he told them a story. "Prince Remmarguts lives in his kingdom UDF-United Delta of Freedom. One day their