Others

Each path can only be taken once, seeking for a path from the start point to the end point and then the shortest path from the start point. The capacity assigned to each route is 1, and the fee is the distance. The minimum fee is the minimum fee

This time I went up again .... The power of the matrix can be used to calculate the Fibonacci series. The specific method is in the following question. Because the power of the matrix can be obtained by the Division and control method, it can

/* We can use the above method to obtain the nth item of any linear recursive formula. The corresponding matrix construction method is: (n-1) * (n-1) in the upper right corner) fill in 1 on the primary diagonal line in the small matrix, fill in the

Tr Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 1695 accepted submission (s): 1253 If problem descriptiona is a square matrix, tr a indicates the trace of A (the sum of all items on the main

For this type of question, each node has two different States, namely, the existence and absence of soldiers. You can find the minimum consumption of different States. 1: the current node is the root node, and the minimum consumption of the

// G (I) = K * I + B // F (I): Maid number/S (n) = f (G (0 )) + f (G (1) +... + f (G (n); // [F (n + 1) f (n)] = [1 1] ^ N // [F (N) F (n-1)] [1 0] // S (n) = sum (a ^ (K * I + B) (0 Gauss Fibonacci Time Limit: 1000/1000 MS (Java/others) memory

Through this question, I have decided to completely discard the original ISAP template and get stuck again... The problem is too big. For now, dinic .... This question is a question about determining the uniqueness of the minimum cut. Creating a

Simple tree Interval Single Point modification interval K value query line segment tree set treap Dynamic rankings Time Limit: 10 seconds memory limit: 32768 KB The company dynamic rankings has developed a new kind of computer that is

This is a complete backpack problem. The number of coins in the question cannot exceed 100, so I added a dimension to the DP array to control the number of coins. This topic lists the types of coins, so you only need to create a table first.  Coin

Create an additional network, find the maximum stream once, and then add (t, s, INF). Find the maximum stream once. If the stream is full, then (t, s) the traffic is the smallest flow. Otherwise, no feasible flow exists. This is also true for poj ..

This question has been pitted for a long time, and it has been TLE. I initially thought it was because I was lazy and used the vector container. Later I changed the vector to a structure array I wrote, but I found it was TLE, so I searched the code

This is an application of the St algorithm. The st algorithm returns the subscript. The smallest number I in each fetch (I + 1, m + J) is the minimum subscript of the previous fetch. M is the number of numbers required in the question (Note: it is

// Question parameter n, x, y // F (n) = x * F (n-1) + y * F (n-2) // S (n) = sum (f (I) ^ 2) 0 The method of pushing the formula for details see this blog, speak very clearly: http://blog.csdn.net/abcjennifer/article/details/5302198Another kind of

I have studied numerical computation before, but I have forgotten it for a long time. So I took it out for review. Finally. The question is obvious. Give you a system of equations (x1, x2, X3, X4, X5, X6, X7, X8, x9, x10, X11) However, the system of

For the implementation of monotonous queue see this blog, write a good http://xuyemin520.is-programmer.com/posts/25964Sliding window Time limit:12000 Ms   Memory limit:65536 K Total submissions:26980   Accepted:8031

Why should we put these two questions together? These two questions are very similar, and the methods for optimizing monotonous queues are the same, so we will be very impressed when we put them together. Poj3017 ---------- cut the sequence

A very watery question, each move can only move one cell to both sides, given the starting point, and the end to find a total number of mobile solutions. The equation of state is: f (I, j) = f (I-1, J-1) + f (I-1, J + 1); represents the total number

Sequence partitioning Time limit:8000 ms   Memory limit:65536 K Total submissions:710   Accepted:207 Case time limit:5000 Ms

The fourth type of matrix multiplication problems. Same as vijos1049. But this time, he gave you the result and asked you to find an original sequence. The specific method is to reverse the conversion rule, and then calculate the power of the matrix

Question address: http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 2925 Question meaning: There are n machines and N services on each machine You can choose to disable a service for each