C++

  Question: We set Ideas: For the time being, the compiler is changed to Dev c ++, which is originally VS2012. To adapt to the Blue Bridge cup compiling environment in a few weeks. You can use the quick power to enumerate x directly.

Question Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will use the integers 0, 1, and 2 to represent the color red,

  Given an array, determine the number of such three elements in the array: either the three elements are mutually exclusive, or the three elements are mutually exclusive.   Ans = C (n, 3)-three numbers have a pair of mutual elements and a pair

You can exchange the values of two elements by passing a pointer or passing a reference. Note that once a reference is defined, it must be assigned a value. Once a value is assigned, it cannot be changed, the reference of object a is the alias of

  There are n numbers and two operations, c a B c and q AB,"C a B C "indicates the range ~ The number of B increases by C,Q AB indicates the query range ~ B's sum.   Ideas: It is a typical problem of segment update and interval summation of line

References: C ++ programming ideas and high-quality programming and network articlesLocal classLocal classDefines a class in a function. (C ++ cannot define a function in a function. C ++ defines the function in the class, that is, the member

There are N soldiers in a row from left to right, numbered from 1 to N. Each of them has killed different numbers of enemies. Now we have Q queries. Each time we ask, we can find the difference between the range [L, R], which has the least number of

Distance QueriesLCA problem: LCA: Least Common Ancestors (recent Common ancestor). For any two nodes u and v with a root tree T, find the LCA (T, u, v ), that is, the farthest node x from the same end makes x both the ancestor of u and v.Online

/* * Solution: * Question: Enter the height of the first cat and the number of cats that work at the end, and ask how many cats do not have to work, and what are the heights and sizes of all cats? * Just clarify the meaning of the question (set H

There are N cities in a country, and M roads connect N cities. Each road has a length of d, and one unit of length consumes one unit of oil. There are gas stations in each city. The price per unit is pi. There are now q inquiries. Each query

Original question link Recursive relationship, a [I]. cas = a [I-1]. cas * 2; a [I]. num = a [I-1]. num * 2-a [I-1]. cas + a [I]. cas; With the ac code: # Include Struct Node {long cas; long num ;}; int main () {int t, n, s, I; Node a [21]

This question is really ac. It's amazing. The time complexity calculated at that time was O (T * N !), The theoretical value reaches 7kw. Practice: Preprocessing the dp array so that dp [I] [j] represents the added value of the length of j after

Analysis: Simulate the question and submit it for countless times. Pay attention to the following points: 1. If a person does not have a valid call record, the person's information will not be output. Here, the question is not displayed after 15

/* * Solution: * Solution steps: Calculate the longest String Length-> sort strings-> except for the longest String Length in the last column, all other columns are the longest String Length + 2 (output this string, fill in spaces for deficiencies) *

A directed graph has Euler's path: In a directed graph, if the graph is weakly connected and two vertices are exceeded, the inbound degrees of all other vertices are equal to the outbound degrees, one point has one more degree of entry than the

/* * Solution: * This is a typical case-insensitive comparison of uppercase and lowercase letters. If the input does not have any other words corresponding to this word, the original single word is output. */ #include #include #include

Problem DescriptionNowadays, a kind of chess game called "Super Jumping! Jumping! Jumping !" Is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now. The game can be played by two Z? Http://

  Question: There is a necklace made up of colored beads. The two half of each bead is made up of different colors, and the two adjacent beads are of the same color in contact. There are some fragmented beads that require you to confirm whether

HDU 4745 Two Rabbits (non-consecutive longest input sub-sequence, interval DP) HDU 4745 Two Rabbits Question address Question:The two rabbits jumped on n rock blocks and formed a ring. Each rock had a weight of ai. One jumped from left to right, and

As mentioned in the previous article, inline member functions can be defined in two ways: one is to define them directly within the class body, and the other is to define the class in vitro. The following code is used: The first definition method: