C++

Description Once upon a time there lived a king and he had N sons. and there were N beautiful girls in the kingdom and the king knew about each of his sons which of those girls he did like. the sons of the king were young and light-headed, so it was

// Dijkstra # include # include # include # include # include # define INF 0x3f3f3fusing namespace std; struct node {int d, p;} mat [1005] [1005]; int main () {int x, y, n, m, a, B, s, t, i, j, k, d [1005], p [1005], minsd, minsp, visited [1005]

The question is: Give a number N and a base D. First, this number must be a prime number. Second, convert the number (1) to the number (2) to the number (3) to the number in decimal format, this decimal number is still a prime number. In this way,

The normal RMQ is used to query the maximum and minimum values of the interval, but if the common dp [I] [j] is enabled, the memory is too large. Given the length of the query range k, so you only need to use an array to save dp [I] to represent the

The question is also relatively simple. The approximate number is T. Each type has N [I] numbers and then uses these numbers to form some sequences, ask the number of x-length to y-length sequences, that is, DP [I] [j] indicates the number of the

Question requirements (1) | ai | | ai-aj |> = T. Because (1) conditions exist, (2) conditions can be established only when ai and aj are positive and negative. It can be seen that the positive and negative values of an element on a certain road in

WeaponTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission (s): 279 Accepted Submission (s): 220 Problem Description Doctor D. are researching for a horrific weapon. the muzzle of the weapon is a circle.

Tree array. Consider ai (from 0, I have I on the left and n-i-1 on the right), x on the left is bigger than him, and I-x is smaller than him, y on the right is bigger than him, and n-i-1-y is bigger than him. The total number of ai-based

You must first select the shortest path. If no Shortest Path is available, that is, several roads are equal, and then take the test. Faster with Dijkstra. Add the corresponding cost when selecting the shortest edge. For details, see the code: #

Solution: first build the graph, note that it is a directed graph, and then use 1 as the source point, the enumeration level limit, that is to say, each time we use spfa to get 1 point to other points that can be reached (due to the level limit, not

There are five types of coins with a nominal value of 1, 5, 10, 25, and 50 respectively. Now, we provide the amount and ask how many methods can be used to make up the nominal value. Solution: every coin has an infinite number, so it is a typical

Question: give you n numbers and ask you to select m heap from these numbers to minimize the sum of each heap, the sum of a heap is the maximum value in the heap minus the square of the minimum value. At last, the sum of all the heaps must be

Strcpy and memcpy are both standard C library functions, which have the following features. Strcpy provides string replication. That is, strcpy is only used for string copying. It not only copies the content of the string, but also copies the end

Calculate the minimum value of F (x) on [] for n quadratic functions Si (x), F (x) = max {Si (x. S (x) = ax ^ 2 + bx + c (0 # include using namespace std; const int maxn = 10000 + 10; int n, a [maxn], B [maxn], c [maxn]; double F (double x)

Question: n under T test data. m indicates n points. m points are directed to the weighted edge. m points are asked: how many test boards are tested from 1 to n maximum streams, I didn't have any idea. I used dinic below. I didn't consider reverse

Time Limit: 1000 MS Memory Limit: 10000 KTotal Submissions: 4472 Accepted: 1884 DescriptionAlice, a charming girl, have been dreaming of being a movie star for long. her chances will come now, for several filmmaking companies invite her to play the

You have k exactly the same water polo in a building on n floors, you want to know the water polo from a few floors down the drop can let the water polo broken. Because you are very lazy, you want to lose the ball at least times to measure the

Method 1: Use map to record whether the nodes in the linked list are accessed. If there are two nodes accessed, it indicates that there is a ring. # Include "iostream" # include "map" using namespace std; map m; bool IsLoop (node * head) {if (!

Problem DescriptionThere was no donkey in the province of Gui Zhou, China. A trouble maker shipped one and put it in the forest which cocould be considered as an N × N grid. the coordinates of the up-left cell is (), the down-right cell is (N-1, N-1)

1. simulate a score query system. The user enters the name and returns the corresponding score. The entire Query Process is run on the server and the Trie tree is used to accelerate the query. Code 2 server: #include #include #include #include