Others

I began to misunderstand the meaning of the question and thought that the audience should meet both conditions. Later, I can see the report on understanding the question. When the audience wants to leave their pets out, the audience thinks they will

After reading the dynamic planning, I have a rough understanding of DP. This question has been stuck before and I am still searching for it at the beginning ~ Pay attention to the processing of 0, start to column the equation wrong, WA several

This question probably means giving you n weights and a balance, asking you to find out the unclaimed weight in the range from 1 to the total N weights. You can use the primary function template to multiply the Polynomials with a negative index.

This question does not provide the source and sink points. You need to add them by yourself. Add a Source Vertex connected to all vertices whose types are P and a sink vertex connected to all vertices whose types are C. The Edge value is given by

This question is caused by two incorrect variables, which are wa several times. # Include # include # include # define Max 101 using namespace STD; struct status {int X, Y; int step; int remain_fly_step ;}; int dir_x [] = {0, 1,-1, 0}; int dir_y [

// DP [I] [J] indicates the maximum Aesthetic Value of J-beam before I vase assembly/dp [I] [J] = max (DP [I-1] [J] ], DP [I-1] [J-1] + cost [J] [I]) # include using namespace STD; const int INF = 1000000000; const int n = 105; int DP [N] [N]; int

/* Line Segment treeUpdate a node with the maximum interval value */ # Include Stdio. h > # Include Stdlib. h > Const Int Maxn = 200001 ; Int Max ( Int X, Int Y ){ Return X > Y ? X: Y;} Struct Segtree { Int L,

/* Given K integer sequences {N1, N2,..., nk}, any continuous subsequences can be represented as {Ni, Ni + 1 ,...,NJ}, where 1 For example, for a given sequence {-2, 11,-4, 13,-5,-2}, its maximum continuous subsequence is {11,-4, 13}, and its

// For the first time, use Tarjan to calculate the strongly connected component. // calculate the strongly connected component first, and then recompose the component to find the point with the degree of 0, and there is only one vertex with an exit

It's hard to understand the meaning of the question .. The following is an excerpt from discuss. Any number greater than 1 is known to represent the product of some prime numbers, that is, x = p1 ^ E1 * P2 ^ E2 ......Pn ^ en (PI is the prime

This is a simulated question... Don't think it's complicated. # Include Stdio. h > # Include Stdlib. h > Struct Person { Int Num; Int B [ 9 ]; Void Init (){Num = 0 ;}};Person [ 1001 ]; Int Book [ 100001 ]; Void

Very Chuo'sCode Monotonous queue There will be better practices to be added later # Include Stdio. h > Struct Queue { Int Idx, Val;} Que [ 1000000 ]; Int A [ 1000000 ]; Int Head, tail; Int Main (){ Int N, K;Scanf ( " % D

// Set DP [I] [J] as the number of solutions for selecting I as J // DP [I] [J] = sum (DP [I-1] [k] ), i-1 # include # include using namespace STD; const int n = 15; const int M = 2005; unsigned long DP [N] [m]; int main () {int n, m, num = 0;

// Hdu1879 or smooth engineering # include # include # define Max 5000 using namespace STD; int father [Max]; int my_rank [Max]; void make_set () {for (INT I = 0; I my_rank [y]) father [y] = x; else {FATHER [x] = y; If (my_rank [x] = my_rank [y])

Number array template question /* (1) Add I j, I and j are positive integers, indicating that J individuals are added to camp I (J cannot exceed 30)(2) sub I j, I and j are positive integers, indicating that J individuals are reduced in camp I (J

This question was originally very easy, because I had missed a condition (Case Insensitive) WA countless times, and I used the sort in STL (the parameter was wrong) Sort (begin, end, CMP) is used to sort Arrays Using sort in STL. The second

// The most basic Query the Minimum Spanning Tree of a set # Include Stdio. h > # Include Stdlib. h > Const Int Max = 101 ; Struct E { Int X, Y, weight;};E edge [ 5001 ]; Int Father [Max]; Int CMP ( Const

# Include Stdio. h > Int Main ( ){ Char Input; While (Input = Getchar ()) ! = ' # ' ){ Switch (Input ){ Case ' ' : Printf ( " % S " , " % 20 " ); Break ; Case ' ! ' : Printf ( " % S " , " % 21

Definition of Reverse Order Number: In an arrangement, if the front and back positions of a pair of numbers are in the opposite order of size, that is, the front number is greater than the back number, they are called a reverse order. The total

/* Classic Dynamic Planning */ # Include Iostream > Using Namespace STD; Char Str1 [ 1000 ]; Char Str2 [ 1000 ]; Int DP [ 1001 ] [ 1001 ]; Int Main (){ While (CIN > Str1 > Str2 ){ Int Len1 = Strlen (str1 );