C++

Question: there are two people A and B, and n questions. Each question has A corresponding score. The probability of B answering A question is 0.5, the probability that A will not lose to B is not less than the Gini score P wants Idea: DP, dp [I]

Source: Ultraviolet A 11865 Stream My Contest 0 is the maximum bandwidth and the total cost of each route must not exceed the maximum bandwidth of c. Idea: one-way 0 is the root is a directed tree. To maximize the bandwidth, the minimum bandwidth of

QuestionIt means that a person sends a pizza to some cities and asks to find a path to traverse each city and return the starting point, and the path is the shortest distance. The final output is the shortest distance. Note: Each city can be

Question: calculate the number of numbers not including 62 and 4 in the interval; Solution: Digital dp. Int dfs (int pos, int pre, bool limit, bool have), pos indicates the digit location from dp to, And pre indicates the number of the previous

Special tools and technologies-optimized Memory Allocation Introduction: C ++ memory allocation is a type of operation:NewAllocate memory for a specific type,And construct an object of this type in the newly allocated memory.The new expression

Question: Connection: Click the open link. Question: N vertices are connected to each other (directly and indirectly) to obtain the shortest distance. Ideas: Prim () Minimum Spanning Tree. Store the distance of a vertex in map. Code: #include

Question: Find the m-th sub-set of the set {1, 2, 3... n. The set size is arranged in the dictionary tree. In this example, the sub-sets of the two elements are arranged in the dictionary tree: {1}, {1}, {2}, {2 }; Solution: determine the number of

Snake filling time limit: 3000 MS | memory limit: 65535 KB difficulty: 3 Description Fill in n * n square Chen with 1, 2,..., n * n, and fill in the snake. For example, if n = 4, Fang Chen: 10 11 12 1 9 16 13 2 8 15 14 3 7 6 5 4

Question: Two 01 string s1, s2. each time you change the m position on S1. Ask how many methods can be used to change s1 to S2. Solution: DP. The key is the state design. It also considers uniqueness and testability. Dp [I] [j] indicates the number

C ++ exercise virtual function-calculate the graphic area Time Limit: 1 Sec Memory Limit: 128 MB Submit: 122 Solved: 86 [Submit] [Status] [Web Board] Description: write a program to define the abstract base class Shape, which is derived from five

A. Another Recurrence Sequence B. Gears There are n Gears, each in a group at the beginning, and then perform m operations, including the following four types: 1. merge two sets of gears, and the two merged gears should be

 LottoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission (s): 1411 Accepted Submission (s): 697 Problem Description In a Lotto I have ever played, one has to select 6 numbers from the set {1, 2 ,..., 49

Problem: For a matrix, the element of the matrix is '1' or '0', and the largest rectangle area consisting of all 1 is obtained. Analysis: before this question, we need to look at another question. Given an array, the elements in the array indicate

Question a, don't talk about it. Question B: sort the lowbits of all numbers of 1-limit directly from the big to the small, and then combine sum from the big to the small greedy. #include #include #include#include #define N 200000

 ACMerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission (s): 3536 Accepted Submission (s): 1629 Problem Description There are at least P % and at most Q % students of HDU are ACMers, now I want to

Source: Light OJ 1334 Genes in DNA The prefix and suffix of the input text string and pattern string (n-1) * (n-1) how many times does a substring of a combined mode string appear before and after the combination of a substring can correspond to

Consecutive Blocks First discrete, then simulate, put the position where a color I is located in G [I], and then enumerate the end position, the sliding window allows the cost between the start and end points to not exceed K. Just calculate the

 Calculate the intersection of straight lines Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission (s): 7923 Accepted Submission (s): 3529 Problem Description There are n straight lines on the plane

Data Structure-simple selection sort)     Selection sort ):In the n-I + 1 record, the records with the smallest keyword are selected as the I-th record in the sequence.   Simple selection sort ):By comparing the n-I keywords, the records with the

This program converts english numbers to Chinese uppercase numbers.The main idea is to use this syntax to construct 1 --> 999999999999 from the bottom up;Convert the numbers into uppercase letters.Flex is used for lexical analysis and bison is used