Others

This question is like finding the maximum sum of continuous subsequences. When DP [I] [J] is set, it indicates the maximum number of people and the maximum number of people pulling J Train cabins by I locomotive. The state equation is as follows:

/* On the copybookProgram..UseC LanguageWrite always wa The most efficient exchange for each selection */ # Include Iostream > # Include Fstream > # Include Vector > # Include Algorithm > Using Namespace STD; Struct

validate the template .... # Include # include # include # include using namespace STD; const double EPS = 1e-8; const double Pi = ACOs (-1.0 ); struct point {Double X, Y; point operator-(const point & T) const {point TMP; TMP. X = x-t. x; TMP.

1062 * Expensive dowry enumeration levels + Dijkstra 1087 * A plug For UNIX 2-Point Matching 1094 Sorting it all out Floyd or topology AC! 1112 * Team them up ! 2 graph coloring + DP 1125 Stockbroker grapevine Floyd 1135 Domino

The same question is wrong twice. Cause: 100000*100000 will exceed int View code 1 # Include 2 # Include String . H> 3 Typedef _ int64 LLD; 4 LLD sum [ 100010 ]; 5 Int MoD [ 100010 ]; 6 Int Re [ 100010 ]; 7 Int Num [ 100010 ]; 8 Inline

I am not very familiar with such questions .. Injury, look at others View code 1 # Include 2 # Include String . H> 3 # Define Maxn 1010 4 Int DP [maxn] [maxn]; 5 Int Sum [maxn] [maxn]; 6 Const Int MoD = 1000000007 ; 7 Int Main ()

# Include Iostream > # Define Maxk 14 Using   Namespace STD; BoolCheck (IntN,IntK){IntAll=N* 2, W=K%All; For ( Int I =   1 ; I N; I ++ ){All -- ; If ( -- W   0 )W = All;W = (W + K) % All; If (W

This is a very strange thing. Scanf ("% S % s", S1, S2) is incorrect during input. Finally, it's not difficult to create a graph by changing the input without words. # Include # include #include #include using namespace STD; const int max = 20

The main reason is to look at Chapter B and Chapter 22nd of CLRS 2. CLRS is really comprehensive and the description is rigorous, although the concept of mathematics is really a headache. Recently, it is better to sort out the concept of strongly

The school is really inefficient. Although it is decadent at home, I learned a lot in a day. A simple sorting of concepts and Topology Sorting has been published yesterday. continue today and forget it if you don't remember it. Rqnoj: 142,193

 Introduction I bought books a long time ago. They are similar to other competition books. For competitions, there should be a lot of small mistakes, and the scope is quite wide, mainly data structures (and query sets, line segment trees, graph

Minimal ring of an undirected graph: returns the shortest path from a certain point. The path has at least three points. Search practices: View code 1 // Search for the minimum ring of PKU 1734 undirected graph 2 # Include 3 #

Source: http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1466 This is a typical binary matching question, and it is very simple. You can use the template to AC. Select M points in graph G of N points so that there is no edge between them.

The path to the basic minimal spanning tree has been created, so you can set the Matrix to 0. // Prim MST # Include Stdio. h > # Include Stdlib. h > # Include String . H > Int G [ 101 ] [ 101 ]; Bool Used [ 101 ];

/* Rmq problem-sparse tableAlgorithmState transition equationDP [I, j] = min {DP [I, J-1], DP [I + 2j-1, J-1]} */ # Include Stdio. h > # Include Math. h > # Include Stdlib. h > Const Int Maxn = 50001 ; Int Max [maxn] [

Monotonous queue Http://www.cnblogs.com/lxf90/articles/2012016.html First, the coordinates of the original sequence are monotonous. Second, the original sequence value is monotonous. /* Monotonous queue */ # Include Stdio. h >

Reprinted from: http://blog.csdn.net/ju136/article/details/8153274 Question: # Interview question # How can I find the first unordered integer array that is greater than 0 and not the smallest integer in this array. For example, [, 0] returns 3,

# Include # Include # Include Using namespace std;Const int MAXN = 250010;Const int K = 26;Struct Trie {Int wordEnd;Int fail;Int next [K];Void init (){WordEnd = 0;Fail =-1;Memset (next, 0, sizeof (next ));}} Tree [MAXN];Int cnt;Char str

# Include Using namespace std; Struct type1{Int parent;Int rank;} FOOD [1, 50001]; Int find (int I){Int t = FOOD [I]. parent; If (t Return I;FOOD [I]. parent = find (t );FOOD [I]. rank = (FOOD [t]. rank + FOOD [I]. rank) % 3;Return FOOD [I].

Learning from http://blog.csdn.net/dooder_daodao/article/details/6336879  View Code 1 #include 2 #include 3 #include 4 #include 5 const double inf = 1e10; 6 const double pi = acos(-1.0); 7 const int Rp = 4; 8 const int shift = 60; 9 struct point