Others

Daffodils Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 96473 accepted submission (s): 28632 Problem description spring is the season of flowers, and daffodils are the most fascinating

Question link: http://poj.org/problem? Id = 3264 It is to give you a string of numbers and ask you the difference between the maximum number and the minimum number ....... Train of Thought: the most basic line segment tree only needs to build and

Link: HDU 4983 wow! Such sequence! There are three operations.1 k d. Change K to increase d.2 l r: query the range from L to R and3 l r, the numbers between l and R are changed to the nearest Fibonacci number. If they are equal, the values are taken.

HDU 4891 the great pan Question Link Question: Given a text, if it is between {}, there are several | there are several Representation Methods. If it is between $, there are several consecutive spaces, there is a space + 1 total representation, ask

Cube stacking Time limit:2000 ms   Memory limit:30000 K Total submissions:18820   Accepted:6530 Case time limit:1000 ms DescriptionFarmer John and Betsy are playing a game with N (1 Moves and counts. *

Question link: http://poj.org/problem? Id = 2777 The question is that you have several different colors in the inquiry range. Idea: This question is similar to the general interval modification, but the only difference is how we calculate the color,

Link: HDU 4891 the great pan Question: Give a text and ask how many ways to understand it. 1. $ in the middle, (S1 + 1) * (s2 + 1) *... * (Sn + 1), Si indicates the number of consecutive spaces. 2. In the middle of {}, that is, the number of | +

Problem description: Given an input string, reverse the string word by word.For example, Given S = "the sky is blue ", Return "Blue is sky ". Solution: Each time a word is traversed, a space character is added to the word (if the temporary string

Wiring Problem time limit: 1000 MS | memory limit: 65535 kb difficulty: 4 Description Nanyang institute of technology needs to transform the power line. The principal now asks the designer to design a wiring method which must meet the

It is the soul of an algorithm program. Many algorithms are sometimes used in a project, the quality of algorithms has a significant impact on the program running efficiency and code redundancy. A very simple algorithm is used in this exercise. The

Alice's chance Time limit:1000 ms   Memory limit:10000 K Total submissions:5280   Accepted:2171 DescriptionAlice, a charming girl, have been dreaming of being a movie star for long. her chances will come now, for

Simpsons 'den den Talents Problem descriptionhomer: Marge, I just figured out a way to discover some of the talents we weren't aware we had. MARGE: Yeah, what is it? HOMER: Take me for example. I want to find out if I have a talent in politics,

N numbers are not in a descending order. Given the range of L, R, the maximum number of occurrences of numbers in the range [L, R] is obtained. You can use a line segment tree. First, let's look at the query. We set the interval corresponding to

The shuffle process is the core of mapreduce, also known as a miracle. To understand mapreduce, shuffle must be understood. I have read a lot of related materials, but every time I read them, it is difficult to clarify the general logic, but it is

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1029 Ignatius and the princess IV Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32767 K (Java/Others)Total submission (s): 16754 accepted submission (s): 6730Problem description "OK, you

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1087Super jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 21884 accepted submission (s): 9589 Problem

/*Question:Chinese Translation:View the most complete programs at the same timeSolution: first sort the final time of each struct in the fast sorting order, and the end time of the previous session should be later than the start time of the previous

Calculate the difference between the maximum and minimum values in the interval. Use two line segment trees, one with the maximum value of the maintenance interval and the other with the minimum value of the maintenance interval. #include #include #

Stacked baskets Time Limit: 1000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 12122 accepted submission (s): 3122 When the Problem description is required, the baskets with different sizes are stacked so that

Ignatius and the princess iproblem descriptionthe princess has been abducted by the Beelzebub feng5166, our hero Ignatius has to rescue our pretty princess. now he gets into feng5166's castle. the castle is a large labyrinth. to make the problem