Others

Look at the report to understand the question shamelessly. Given the sequence n of a train box (and the passengers that each box can accommodate), three front trains, and each trainThe train box sequence that can be pulled by the head M. Find the

I read a little network stream some time ago. Unfortunately, every summary is written. Every review, so I will try again today... Thank you for your summary. Several Basic concepts: 1) Residual Network: a Flow Network Graph G = (V, E), under the

Truck history Time limit: 2000 ms   Memory limit: 65536 K Total submissions: 9665   Accepted: 3556 Description Advanced Cargo Movement, Ltd. uses trucks of different types. some trucks are used for

Euclidean Algorithm That is, the division of the moving phase.CodeThe framework is as follows: IntGcd (IntA,IntB ){ReturnB? Gcd (B, A % B):;} Rough Estimation requires O (log B) integers. In fact, when n is fixed, the average iterations of

01 it's a tough question. I can't write my skills... I don't know where the problem is. The priority queue can be written directly. Note that there are two-way edges and self loops. I want to vomit HDU _ int64   03 A dp question, but it needs to

Bipartite graph: A bipartite graph G refers to a graph. All its fixed points are divided into two sets X and Y. X or Y are not connected to any two points in their respective sets, an edge can be formed at two fixed points, X and Y, respectively.

2-Sat water questions, also wa several times, it can be seen that this dish is more water... On the courseware, there are explanations... Slag code:View code #include #include #include #include using namespace std;const int N = 2012;const int M = 10

The couple only wash their clothes in one basin. To prevent different colors from being mixed, they use a basin to wash clothes at the same time, but they can only be the same color. Now we know that the number of colors is m, the number of clothes

For some coordinate points, if the distance between the two points is smaller than R and there are no other points between the two points, the two points are connected, which forms a graph. Ask the number of spanning trees in this graph. Because the

Recursively create a binary tree and traverse in the middle order .... View code #include #include #include #define N 10000int l[N], r[N], key[N], flag;void insert(int index, int x){if(x {if(l[index] == -1) l[index] = flag;else

Zhou dong's paper "count and Application of spanning trees" talked about the issue of generating tree counts. A Kirchhoff matrix is used, which is defined as follows: A. Set a degree matrix D. When I = J, dij = (the degree of the node I); otherwise,

It is also a problem of generating trees... The second generation tree, as its name implies, is a generation tree that is slightly larger than the smallest one, ^ _ ^ The method is: 1. Find the Minimum Spanning Tree With the MST Value 2. vertex of

I read the sample after reading it for a long time! Later, I asked other people to know. Then he looked at other people's ideas shamelessly. Speechless. Thought: DP [I] [J] indicates the number of cases where the number of bias after the first I

UESTC question... Sure enough, the meaning is so obscure. 01 Push rule, mod r. Even wrong... It takes only one hour. 06 Three points. I still don't know how to prove that he is a concave function .. I think this is a concave function... How to prove

The general idea is to block an edge I-> J, and find the shortest path dis [I] [J] from I to J. Dis [I] [J] + W [I] [J] is a ring. Find the minimum value in all rings to get the minimum ring. But... If Dijkstra is used to calculate the shortest

Reprinted: http://blog.sina.com.cn/s/blog_616694280100f06p.html Two ways to store an image: the adjacent matrix and the adjacent table;    There are two traversal methods: depth first and breadth first;   First, store a graph with a struct: Struct

/* Name of the adjacent table used for graph creation, complexity O (E * loge) */struct pnode {int num; int Len; pnode () {} pnode (int A, int B ): num (A), Len (B) {} bool operator TMP. len ;}}; int dis [N]; bool vis [N]; int N; void BFS (INT s)

Streaking matrix multiplication is now a template. #include #include #include using namespace std;const int N = 2;const int MOD = 10000;struct Mat {long long mat[N][N];void init() {for(int i = 0; i for(int j = 0; j mat[i][j] = (i ==

Two typical examples: poj 1753 and poj 2965; Poj 1753 status transfer: 1 int flip (INT POs, int I ){2 POS ^ = (1 3 if (I + 4 4 If (I-4> = 0) POS ^ = (1 5 if (I % 4 + 1 6 if (I % 4-1> = 0) POS ^ = (1 7 return Pos;8} Poj 2965 status transition: (do

The tree array is more elegant than the line tree... We have done a good job in anti-prime number tabulation, that is, the formula for pushing the next position from the current position has not been developed, so we can see other people's... If (P [