C++

Question:My little sister had a beautiful neck?made of colorful beads. Two successive beads in the neck?shared a common color at their meeting point. The figbelure ow shows a segment of the neck=: But, alas! One day, the neck1_was torn and the beads

Problem descriptionGiven n elements, which have two properties, say Property A and Property B. For convenience, we use two integers AiAnd BiTo measure the two properties.Your task is, to partition the element into two sets, say Set A and Set B,

The basic dictionary tree, also known as the word search tree and Trie tree, is a tree structure and a variant of the hash tree. A typical application is used for statistics, sorting, and saving a large number of strings (but not limited to strings).

This topic is very simple, that is, the simplest minimal spanning tree, and it is easy to use the kicar algorithm.However, The number of possible routes is unlimited. What should I do if there are many sides? Of course, you just need to open more

[Cpp]/*Question: n students, some male and female students have fate to become a couple, in the format of ni :( m) n1 n2 n3 indicates that ni has a fate with n1, n2, n3 as a couple, find the maximum number of students who are interested in a couple

[Cpp]# Include # Include # Include  Using namespace std; Class CommandBase{Public:Virtual void run () = 0;Private:}; Class Command1: public CommandBase{Public:Command1 (string strName): m_strName (strName ){};Void run (){Cout }Private:String

I did it with dp. After I finished the work, many people on the internet used the formula. I didn't see it anyway.Dp [I] [j], I indicates that column I is put into a vertical bar, and j indicates the shape of the vertical bar. There are five

To The MaxTime Limit: 2000/1000 ms (Java/Other) Memory Limit: 65536/32768 K (Java/Other) Total Submission (s): 30 Accepted Submission (s): 16 Problem DescriptionGiven a two-dimenstmarray of positive and negative integers, a sub-rectangle is any

There are some integral points in the range [] and n constraints (u, v, w) are met, that is, in the range [u, v] has at least x vertices. The question range [0, 50000] has at least a few vertices.Idea: spfa (adjacent table) + difference constraint.

Question: Chinese question...Idea: Set A = k * 9973 + n, A/B = C, C = P * 9973 + x, and x is the answer. Yi Zhi, A = k * 9973 + n = B * P * 9973 + B * x, after simplification, k * 9973 = B * P * 9973 + B * x-n, so (B * x-n) % 9973 = 0, the value of

Run the Splay command again.This includes interval cutting and reverse operations.For the Splay processing interval [l, r] L-1 to the root and r + 1 to the right child of the root, so that the Left subtree of the right child of the root is [l, r],

Question: Exam rankingTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 5525 Accepted Submission (s): 1935Problem DescriptionThe real-time submission system used for the C ++ programming

I simply used a binary search tree for a standard search.[Cpp]# Include # Include Using namespace std; Class TreeNode{Public:TreeNode ();TreeNode (char str []);Char name [40];Int number;TreeNode * leftChild;TreeNode * rightChild;}; TreeNode:

[Cpp]/* Basic query set. Every time a group is read, the following persons are merged into the first one. At the end of the query Record the number of people with the same ancestor as 0 .*/ # Include # Define maxn30001Int f [maxn];Int n, m, k, t,

Q: There is a light source that is pinned by several circles. Ask for a shadow on the ground. Question: use vector rotation to obtain the two intersections between the tangent and the circle, and draw a straight line of aX + bY + c = 0 based on two

A wa during the competition! Good InjuryFirst, compare the two arrays, equal to 1; otherwise, it is zero. Put the 01 array at the bottom of the Line Segment tree, and then update it up.A line segment tree has two attributes: ml stores the maximum

[Cpp]# Include Typedef unsigned char uint8;Typedef unsigned int uint16; Sbit ADDR0 = P1 ^ 0;Sbit ADDR1 = P1 ^ 1;Sbit ADDR2 = P1 ^ 2;Sbit ENLED1 = P1 ^ 4;Sbit ENLED2 = P1 ^ 3;Void display ();Void int_init ();Main (){P0 = 0x00;ENLED1 = 0;ENLED2 = 0; //

I wrote hash during the competition and had timed out. Later I realized that I had not removed the same value, so I gave up the optimization. I will think about it later. [Cpp]# Include # Include # Include # Include # Define ll _ int64# Define mm 100

Question: divide the number to calculate the median. You need to add a sum array. In this way, you can find the sum of the numbers smaller than the median in the query process. [Cpp]# Include # Include # Include # Include # Include # Include #

Line Segment tree, reverse insertion [Cpp]# Include # Include # Include # Include Using namespace std;# Define N 200010Struct cam{Int x, y;Int num;} List [N * 8];Int pos [N], value [N], ans [N];Int n;Void build (int k, int x, int y) // The number of