Others

Question: Give a number of columns .. several inquiries .. q (L, R, h )... within the range of [L, R .. how many numbers are less than or equal to h .... Question: The second K is small... use the Division tree to find the number of K small...

Http://wenku.baidu.com/view/8861df38376baf1ffc4fada8 In my previous article, I always felt that the paper was not detailed enough, but I can understand many things. First, the tree is split into a series of chains, and then the chain is

So water .... /************************ Creater: sevenster ** time: 15:2.07.31 ** PID: poj 2318 **************************/# include # include using namespace STD; Class cpoint {public: Double X, Y ;}; class cvector {public: Double X, Y ;};/**

Question This is a simple game. In an N * n matrix, find n numbers so that the n numbers are in different rows and columns, and the difference between the maximum and minimum values of the N numbers is required to be minimized. Question The

It's hard to see a new update of opensuse ~~, I will not talk about it later ~~, To those who are interested in this article. First (reprinted, please note: source; phodal's blog) Disable existing opensuse 12.2 software sources, and then we need

After reading the questions ~ Write treap Deliver, TLE Is the random number too slow? Change ~ Submit again ~ T again Modify splay? No ~ Offline line segment tree TLE AI has gone through parameter modification with the code. All kinds of T

Abstract question: A little p starts at the initial point (px, py) at a counter-clockwise speed ~~ Point Q is at any position on the plane (excluding the gray circle r). Point Q can be at a maximum speed of Q in any direction. v mobile... Q cannot

Question: Bob and Alice are playing ~~ Alice has mastered the pattern of Bob ~ Know what Bob goes out of every round .. bob specifies that some of Alice's round outputs must be the same or different... if Alice wants to win .. you must be unbeaten

The data is incorrect. The reading file is incomplete... so there will be no number to read in the end... it's speechless... It's really amazing... This line segment tree can also be done offline... I started to use treap. the result times out...

Problem DescriptionDigital LC-display is widely used in your different fields such as electronic calculator, electronic watch, digital instruments, etc. A simulated example of the numbers represented by digital LC-display device is shown as follows:

Question: There are N cowshed... there is no link between them .. now we are going to establish a transfer station in two places .. each cowshed builds a path to a transfer station... some cows are hostile to each other .. cannot be connected to the

Question: In a directed graph, each side should have a length and a toll, and now K yuan is in hand .. from 1 to N... ask what is the shortest path length of the total toll. Question: First, pay attention to the following details: 1. The question is

Question: Each wand corresponds to some wizard... ask how many pairs can be matched successfully at most. Question Maximum matching of a bare bipartite graph

Question: In a matrix of n * n (n Question: Separate each color... side (x, y ).... because for a balloon (x, y ).. as long as x is used or y is used .. then this balloon will be eliminated... how many points should I use to convert a question ..

Question: There is a TV program called "Cat vs Dog ".. every guest will either like a dog or a cat or a dog .. ask how to arrange for the most guests to be satisfied with cats and dogs ).. Question: This question gives us a better understanding of

Question: The following figure shows the undirected graph .. the king has to divide the state .. if u has paths (v, u) and (u, v) in the first two States, they must be in the same state... after the State is established... any two points in a region

B-nails and ballsTime Limit: 1000 MSDescriptionThere is a triangle board, standing upright, with n (n + 1)/2 nails and (n + 1) grids (whenN = 5 hours 1 ). The distance between each nail and the surrounding nail is equal to d, and the width of each

[Topic] Given an undirected graph, find the smallest ring in the graph. And outputs the number of smallest rings. [Solution ideas] 1. Simple algorithm. For edge e (u, v), the shortest path mind (u, v) after removing e, then the minimum ring is mind (

The most simple and short-circuit problem, the key of which is that some farms do not have cattle. These farms can go, but they cannot be included in the final answer. After all, what is needed in the question is the shortest path of cattle. Take

An interesting question. It's just that today's courses are tight. I knocked on the question at noon, and then I knocked on the question after class in the afternoon. After some bugs have been changed, we have finally finished. Encourage me