C++

Artillery positionsTime Limit: 2000 MS Memory Limit: 65536 KTotal Submissions: 16003 Accepted: 6077 Description The generals of the Headquarters intend to deploy their artillery troops on the grid map of N * M. A n * M map consists of N rows and M

After so long, I finally made an offline line segment tree .... I personally think that if the inquiry will affect each other, I will use the so-called "offline... This question is considered to add numbers one by one from left to right. If a [I]-1

ConsortiumTime Limit: 1000 MS Memory Limit: 65536 KTotal Submissions: 6325 Accepted: 2184 Description Windy has a country, and he wants to build an army to protect his country. he has picked up N girls and M boys and wants to collect them to be his

Page 1 of the White Paper. Question: Qin Shihuang wants to build a road project to connect all cities. Then, the Taoist Xu Fu can help him build a path without labor. Two variables are given: Let the population at the beginning and end of the road

Here is a SuperSale in a SuperHiperMarket. every person can take only one object of each kind, I. e. one TV, one carrot, but for extra low price. we are going with a whole family to that SuperHiperMarket. every person can take as example objects, as

/*************************************** * ******************************* // @ Author lynnbest target: multiplication exp of polynomials: A (X) = 2X ^ 3 + 4 B (x) = 4X ^ 4 + 2X ^ 3 C (X) = A (x) * B (x) = 8X ^ 7 + 4X ^ 6 + 16X ^ 4 + 8X ^ 3 train of

Since each group of data has a maximum of 20 data records, the total length of the data may consist of a maximum of 2 ^ 20 about 10 ^ 6. An array can be put down, and I use a vector. Select the creator of the total time length stored in the vector

Question: n teams play a game. Each two teams only play one game. The team wins three points in the specified time and loses 0 points. If the team hits the overtime match, the team wins two points, if the score is 1 point, the final total score of n

Tree links are divided into several chains in one sentence, and each chain is maintained using the data structure (tree array, SBT, Splay, line segment tree, and so on, if the complexity is O (logn), the first step of tree chain partitioning is to

The question is in Chinese .. In fact, it is to find the reverse logarithm of a sequence. Use the idea of divide and conquer, and change the order slightly. Code: /* * Author: illuz * Blog: http://blog.csdn.net/hcbbt *

C. tourist Problemtime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputIahub is a big fan of tourists. he wants to become a tourist himself, so he planned a trip. there are n destinations on a

RobotTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others) Total Submission (s): 1600 Accepted Submission (s ): 599 Problem DescriptionMichael has a telecontrol robot. one day he put the robot on a loop with n cells. the

Because of the existence of 1, the problem becomes more difficult, so it is relatively simple to remove 1, first bfs, process the points that each point can reach in one step (it must be one step ). then, we can use bfs on the New Graph to calculate

# Include # include # include using namespace std; struct node {int l; // left start point int r; // right end point int sum; // interval data sum}; node p [200004]; int a [50001]; int n; void bicould (int k, int l, int r) // create {int mid; p

The question is to give a connected undirected graph, find all the cut points of the graph, and output the cut points and the edge to be removed, it will become the basic question of several connected component ideas to use tarjan to find the cut

# Include using namespace std; # define MAX_NODE 30 # define MAX_INFO 10 bool isOutput [MAX_NODE]; // record whether the node outputs struct ListNode {ListNode () {next = NULL;} int position; ListNode * next;}; struct VertexNode {VertexNode ()

The first line of enumeration, in binary format, can be introduced in subsequent n-1 rows. Whether the push side verification meets the requirements. Save the optimal solution #include #include #include #include using namespace std; int a[20][2

Question link: uva-10304 question to a sequence can be S = (e1, e2 ,..., and e1 /** =================================================== =================== * This is a solution for ACM/ICPC problem ** @ source: uva-10304 Optimal Binary Search Tree *

Sometimes we need to embed a video player into the webpage to play the video on our server. Below I will post the code: embed the Video Player: file list: file 1 33 days out of love PIGA pig  Corresponding js control code

Question: Give the coordinates of N points, take some points from them to form a polygon, and find the minimum area of the polygon, output "Impossible" (number of test groups T Minimum area. If yes, it must be a triangle. Determine whether a