Others

/* Idea: the question is a bit similar to the deformed Joseph ring, but it feels a little troublesome to use the linked list. So I used arrays to simulate every idea at the beginning. Then I saw a good idea on the Internet, I understood it and typed

Question: matching brackets Idea: Use the stack in STL to remember that the empty string is yes. # Include # include # include # include # include using namespace STD; int main () {int N; char s [150]; scanf ("% d", & N); getchar (); While (

Enter N, N as the number of layers, enter the value of the leaf node of each node at the bottom layer, enter M commands, start from the first node, 0 is left, 1 is to the right, and the final output command string Idea: Use Arrays for simulation.

Liquid, you can write it. I don't know why it takes three days to write. It's been four days, You can write it. It should be written. Write it! CodeFor example, Shi, No false. Only shi! = Poetry, But .. // You know Is-port ma-port column?

 Pai_^ O (too many) O... I'm just about to make a joke. It's so ugly to see so many face text. This is a small variant of the tree DP classic .. First, let's take a look at the name of tree DP,The tree-like tree tells us that this is a

Question A: greedy. If the number of people in a gender is small and the number of people is small. Copy the file directly during the competition .. After changing n to m, the game data will lag behind. = !! Question B: directly divide the two

Enter a set of data. Each element has a priority from 1 to 9. Calculate the time required after the target task is completed. Idea: if the priority of the first element is not the highest, put the element at the end of the queue. If the element has

There are two trees. check whether there is a vertical line on the two sides of the line, and find the left of the two ends of the vertical line. Idea: in fact, the meaning of the question is like four points to form a square. Similarly, the

The size of a nested doll in the lower layer is smaller than that in the outer layer. It is possible that there are multiple dolls in the same layer, and the sizes of these dolls are smaller than those in the outer layer, it is equivalent to an

Question: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1465 F [N] = (F [n-1] + F [N-2]) * (n-1) When there are n envelopes, you can consider that the n envelopes are originally correct. There are only two options for this envelope. One is to

Question: http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemid = 249 It's a push box again .. The question is the minimum number of times required to push the box. Then BFS is started with a box. Each time you determine whether a person (BFS)

Question: four points are given to determine whether two line segments meet each other (intersection). The same line is parallel. Train of Thought: first determine whether it is the same line, use three-point collinearity to determine whether P1 P2

395. [usaco oct09] Bessie weight problems ★Input file:diet.inOutput file:diet.outSimple comparisonTime Limit: 1 s memory limit: 128 MB Bessie, like many of her sisters, grew too much because she had eaten too many delicious grass from Farmer

# Include # include # include # include using namespace STD; int n, m; int A [100001]; // Number of leaf knots N _ int64 ans; struct {int L, R; _ int64 sum, add; // _ int64} tree [400000]; // In the number, the number of all nodes is about 2 ^ 2

152. [usaco dec07] quagmire ★☆Input file:mud.inOutput file:mud.outSimple comparisonTime Limit: 1 s memory limit: 128 MB Translated by cmykrgb123 Description Farmer John went to milk Bessie on time at a.m., but his farm became muddy after

A piece of code is easy to comment and read. # Include # include # include using namespace STD; const int max = 26; // 26 letters. If the dictionary tree is a binary number, max = 2; struct trie // you can define the number {trie * Next [Max];

Recently I am looking at the tree array, which is simple and one-dimensional. Experience. The owbit (x) process is not repeated, that is, return X & (-x) bitwise inversion and addition can be used to store tables in order to facilitate queries

Line split plane Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 13253 accepted submission (s): 9172Problem description we have seen a lot of questions about straight line split planes. Today's

A + B again Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 11804 accepted submission (s): 5152Problem descriptionthere must be between a + B problems in our hdoj, now a new one is coming. Give

Rmq with shifts In the traditional rmq (range minimum query) problem, we have a static ArrayA. Then for each query (L,R)(LR),We report the minimum valueA[L],A[L+ 1],...,A[R]. Note that the indices start from 1, I. e. the left-most ElementIsA[1].