Others

The string matching question is refreshed for three days. In order to continue to cut the question below, I would like to summarize some. The most basic algorithm for string matching is enumeration (n ^ 2 ). What is more advanced is KMP. KMP Has

It seems that we still need to understand the meaning of the backpack!I have written more than 3600 pieces of code, all kinds of tragedies. I still have a poor understanding of the backpack!After reading the code, A came out

Really bad HH God can come up with this disgusting question! And the description of the question is still so boring! Parity is not clear! #include#includeusing namespace std;char str[1111];char l1[111];char l2[111];int len;void work(){

[AC] 1062 * expensive dowry enumeration Level Limit + dijkstra1087 * A Plug for UNIX 2-Point Matching[AC 2011-9-20] 1094 Sorting It All Out floyd or Topology1112 * Team Them Up! 2 graph coloring + DP[AC 2011-9-20] 1125 Stockbroker Grapevine FLOYD[AC

The original question of last provincial competition .. This year, we basically forgot about the line segment tree. I typed it again today. I found that my input processing is not bad. This type of Weak Explosion of line tree... Because of the

This question is very interesting. It is actually to find the shortest path, and then use the shortest path value * the sum of the node values. Through this question, I found another bug in programming. I always wanted to save space, and the result

Question: There is an R * C (R Calculate now: one row happens to be obtained in each column, and at least one method is obtained in each row. the rows of the pawns are extracted from small to large output in the column order. My ideas: Since each

This is essentially a shortest path problem. The shortest path from 1 to N is less than or equal to K. Each route has a cost and a length. We still adopt the greedy idea of dijela. Every time we get greedy, we will update other points based on this

D is a vertex set of graph G. For any vertex U of G, U is the vertex element of the D set, or U is adjacent to a vertex of the D set. D is a dominant set of graph G. If, after removing any element from D, D is no longer the master set, D is called

There are too many people who do not know, and often want to know anxiously, because of this mood, so I am willing to share with you what I will share-this is also my purpose to create this blog! Today, I found myself working hard to make a question,

Long Distance Taxi Time Limit:30000 ms,Special Time Limit:75000 ms,Memory Limit:65536KB Total submit users:11,Accepted users:7 Problem 12523:No special judgement Problem description A taxi driver,

Related questions:Http://blog.csdn.net/kksleric/article/details/7433909 Max matching Hungary algorithm: A recursive method can be used to describe the augmented path. This description is not necessarily the most accurate, but it reveals the general

1.Only do the work that needs to be done Use agile methods; Wholeheartedly design UX; Communication first; Encoding may not be the solution; Premature optimization is the root of all evil; Select the simplest solution. 2. standing on the

Question: There are 150000 numbers and 10000 operations. Change the number of I to x each time, and question the number of backward pairs after each operation. Solution 1: Tree array + treap. Each element of the tree array is a tree. In this way,

A directed graph is given. Each side has a length of 1. delete at least a few points, make the shortest path length from 1 to n greater than k (number of non-intersecting paths whose length is less than or equal to k) The first method is AC: First,

[Problem description] Print the binary tree created in [binary tree 1] layer by layer, that is, the first line prints the 0th layer root node, and the second line prints the first layer ...... And so on. [Example] A binary tree is as follows:

It seems that there is no summary of this topic. I have seen four people who have asked such questions in a row over the past few days. I will briefly write them here today. Here we will not introduce other matrix-related knowledge, but will only

A matrix of n * n. Each time an element in the upper left corner is colored, all the elements connected to it (the two elements are connected by a public edge) are colored in the same color, how many operations are required to make all elements of

Extremely small search:  When A and B are playing games, it's the turn of A to play games. Then we will traverse every possible method of A, and then traverse every method of B's playing games for each method of, next, traverse every playing method

One night, four people needed to go through the dangerous bridge in the valley. At any time, only two people were allowed to go over the bridge, and a flashlight was needed for crossing the bridge. These people only had one flashlight. It takes 10, 5