Others

Let's cite all the situations as required by the questions ~~~ It is from to start DFS... it is worth noting that in fact, in addition to the conditions for the end of a path ~~ There is also the border or # No place for the clip ~~ I did not think

Each segment 0... separate processing of 0 .... use DP [2] to record the current optimal situation... DP [0] indicates the index of the maximum positive number 2 that can be obtained from the current position .... DP [1] indicates the 2 Index of the

Keep W small h large... keep a It is possible to calculate the number of brute force settings in two cases. It is too troublesome to add a helper line. Program: # Include # include # include # include # include # include #include

(1) first open shangxing remote control software. The Wan (no Internet IP address) LAN is displayed, but the Intranet IP address is 193.168.1.30) (2) the data on the active server can only be transmitted over the Internet, so you need to build a

Question: In kindergarten .. each child vote for leadership... the children with the most votes become leaders (if there are multiple .. multiple leaders ).. now we have a very unique leader .. so I am going to bribe some children .. let them vote

The key to this question is to grasp the relationship between T and B in the process... if the current operation is 'T '... so T = T + B .. apparently T> B .. if the current operation is 'B '... the operation is B = T + B .. apparently B> T... so if

The length of an original string must be at least 3. How can I add characters on both sides to make it a periodic string (with a cycle of more than 2) with the minimum number of characters required? Idea: in fact, it's just a flexible use of the

Http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 20851 # overview A set of matrix and Gaussian elimination questions are introduced. POJ3233 gives A matrix A and then calculates (A + A ^ 2 + A ^ 3 + ...... + A ^ k) % m The first thought

A long time ago, I heard that treap could write this question, and then watched the god code, and then ~ It is much easier to write than using splay. Here we need to change the method of treap. A normal treap maintains a weight value for each node

Example: Train of Thought: manacher algorithm. I didn't understand it for the first time. I finally understood it this time. It is very similar to the extended KMP .... First, I will post the ideas I have seen on my blog: In fact, the original text

2012-12-25 I just changed the queue in the pre-stream propulsion to the priority queue [hand-written heap, don't STL to kneel down]. Why is the speed getting slower? The QAQ speed is measured with POJ3469, and the normal pre-flow is promoted for 2.7

Desert trip Time Limit:1000 ms Memory Limit:65536KB64-bit integer IO format: % LldJava class name: MainPrev Submit Status Statistics Discuss Next "Chubby is going to go through a desert, while Chubby is driving a huge jeep, which features high

Link: http://poj.grids.cn/practice/2754 Total time limit: 1000 ms Memory limit: 65536kB Description Everyone who plays chess knows that the queen can eat other chess pieces at the horizontal, vertical, and diagonal

Eugeny and Play Listtime limit per test 2 secondsMemory limit per test 256 megabytesInput Standard inputOutput Standard output Eugeny loves listening to music. He hasNSongs in his play list. We know that song numberIHasThe durationTIMinutes.Eugeny

IDX is used to calculate the subscripts of a line segment tree. In this way, we can write a line segment tree that only opens 2 * N. Added a new rands Function ~ Used to generate random numbers. [Add

This is a set of dynamic tree I opened the topic: http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 25242 # overview First, let's talk about what a dynamic tree is. A dynamic tree can maintain a dynamic forest. It supports merging trees (two

Powerful pascal code Delphi code Suddenly we found that pascal's functions are quite powerful. Example 1: Allows you to zoom in, zoom out, and exit the interface. The following code is run: Example 2: Small Program for

I couldn't figure out the beauty of programming yesterday. I looked at other people's methods... I searched for water in three minutes... I haven't written it before... The three points have evolved from the second point... the greatest value can be

Enumerate each vertex ~~ Determine whether the distance between two straight lines is partitioned by line segments (two difference multiplication judgments)... and then Floyd will be O... to keep the feeling completely ~~ But it's also very annoying.

Question: There are N astronauts logging on to the planet .. astronauts of an average age greater than or equal to the average age are old astronauts... and then the little astronaut... old astronauts can log on to Planet A and planet C .. little