C++

Give you a tree and mark it as 1 ~ N, each edge has a certain edge weight, so there is a maximum distance from each vertex num [I];First obtain the num [] array, and then there are 500 more queries. For each query, enter an integer m, evaluate the

Problem DescriptionIn specified applications very large integers numbers are required. some of these applications are using keys for secure transmission of data, encryption, etc. in this problem you are given a number, you have to determine the

Function templates are widely used in actual programs because of their own characteristics: After defining a function body, you can call them multiple times for instantiation.Example:[Cpp]# Include Using namespace std;Template // function template

From yesterday to today, I made four simple questions. A new page is enabled. Milk: It's easy and greedy. Select a cheaper price first. Code: [Cpp]/*ID: duanjia2PROG: milkLANG: C ++*/ # Include # Include # Include Using namespace std;Struct node{Int

This question A is amazing... I just made A guess... I wrote the following very cool and ugly code... I actually gave it to AC...I am the one-digit confirmation .. in general, it is feasible .. with the depth of the exact bit .. the answer will get

Given an order for n kinds of products, each product has an initial price pri, the initial quantity numi, and then the m combination, these combinations will get a cheap price. Finally, I asked how to make the total price the least. Solution: I

The optimal matching of a bipartite graph. Find the minimum billing flow. The minimum cost for matching all vertices is required. simply apply the KM algorithm .. The following is the 1853 AC code:[Cpp]# Include # Include Using namespace std;Const

The meaning is to convert the decimal number to the binary number. The number of 0 is greater than or equal to 1. Given a closed interval, find the number of such ranges.   Description The cows, as you know, have no fingers or thumbs and thus are

Note that this question may be Crash. Use the Color [] = 0 1 2 solution, instead of using Parent [] to limit a tree. You can also use [Cpp]# Pragma comment (linker, "/STACK: 1000000000 ")But not recommended Code: [Cpp]# Include # Include # Include #

Add a given cube (unlimited) together. The condition is that the length and width of the cube above are longer than the length of the cube below. And width and short; find the highest height of the top layer of the long side. (where (, 1) can be

[Cpp]/*Greedy: s2-w1> s1-w2*/# Include # Include Const int nmax= 100007;Struct Node{Int wi, si;} Node [nMax];Int N; Int cmp (const void * a, const void * B){Node * pa = (Node *);Node * pb = (Node *) B;Return (pa-> si-pb-> wi)-(pb-> si-pa-> wi

RdersTime Limit: 1000 MS Memory Limit: 10000 KTotal Submissions: 8100 Accepted: 5048Description The stores manager has sorted all kinds of goods in an alphabetical order of their labels. all the kinds having labels starting with the same letter are

You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. it takes one minute to move one unit north, south, east, west, up or down. you cannot move

# Include  Using namespace std; # Define LIST_INIT_SIZE 100 // initialize the allocation volume # Define LISTINCREMENT 10 // increment of storage space allocation  Typedef int Status; Typedef int ElemType; Typedef struct { ElemType * elem; // The

Question: to give an undirected graph, we need to find each cut point and divide the graph into several connected blocks after the cut point is removed. Question: calculate the number of connected blocks of the cut point based on the dual-Unicom of

Using namespace you will find that there are more than n articles, but basically it is the article that is constantly reposted. I don't think it is very clear, so everyone can understand it, prevent name conflicts... The usage of custom namespaces

Question:For a sequence of n numbers a1, a2,..., an, the range of these numbers is 0 ~ N-1, you can move the number of m above to the back to form a new sequence:A1, a2,..., an-1, an (where m = 0-the initial seqence)A2, a3,..., an, a1 (where m = 1)A3

Problem description: It is the fastest way to identify manufacturing problems through factory assembly lines. There are two assembly lines. Each assembly line has n assembly stations numbered j = 0, 1 ,... , N-1. Assembly line I (I = 0 or 1), the

There are four types of polymorphism in C ++. 1. Parameter Polymorphism Such polymorphism includes function templates and class templates. 2. Inclusion Polymorphism This polymorphism is the soul of C ++ object-oriented programming. 3. Heavy

[Cpp]Description: This is a very troublesome question. To be precise, it is to specify the radius of m circles,Now we need to find a rectangle so that every ball is tangent to the ground,The minimum length of the output matrix is required.# Include #