Others

Http://www.rqnoj.cn/Problem_460.htmlQuestion: If n people stand in one team, if each person is not taller, they can see each other and ask how many people can see each other .. Analysis: monotonous queue, not to mention... However, we need to deal

2012 Changchun division network competition... Question Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4267 01 there are two operations for Array ai with an initial value1. Add C to the value of each AI that satisfies (I-A) % K = 0 in the range

There are n planets, each of which has a certain power value. Some planets are directly or indirectly connected... When a planet wants to seek help, it will find a planet with the largest power value and greater than its own... Given these power

G, (BUPT 201) Http://acm.bupt.edu.cn/onlinejudge/newoj/showProblem/show_problem.php? Problem_id = 201   There is an array a [] with a corresponding array C [], C [] with 0 or 1 stored, defining L (I, j) = min (A | I... J); Evaluate ans as the

    Http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemid = 4381 Contest:Zoj monthly, July 2011 Give you a tree, 10000 nodes, each node has a weight value, tell you the weight value of each node and Father's Day point, and then 10000 queries,

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3954   Initially, each hero's level is 1, experience is 0, and m Li Ri EI indicates to send li -- ri to fight monsters. The experience of each harvest is the current level * EI, Q Li Ri indicates the

Http://acm.timus.ru/problem.aspx? Space = 1 & num = 1297   Returns the maximum echo substring of a string.   Analysis: You can use manacher to easily solve the problem, or use a suffix array... For a suffix tree Group, a non-existent value is set in

  There are a total of 1-elements. Every time m a B is to put the stack where A is located in front of B, C A indicates that there are several elements under... 10 ^ 6 queries     Analysis: At first, I didn't know how to store the number

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3911 Multiple schools (8)   Given an array element with only 0 and 1, there are two operations. 1 I j indicates changing all elements of [I, j]. 0 I j indicates seeking [I, j] the length of the longest

[Question link] http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1004   [Topic] If n strings are specified and the most frequently occurring strings are obtained, the strings must be output;   [Analysis] Map question, record string. Each time a

The descriptions of the questions are not good. If there are a lot of scolds in the post, I can't understand question B and question D, and I guess question C, I will find that I will do it, but I don't have time to get the AK after the game. A.

Http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemid = 3971 The longest string that appears at least m times in an array...   Analysis: The second answer can be used to determine .. For the length of each judgment, you only need to check

Http://poj.org/problem? Id = 1743 Given n numbers, ask for a "substring" of N numbers to ensure that this substring appears at least twice in the original array, the two substrings do not overlap (and the two substrings are not exactly the same, but

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3974Given a tree with 50000 nodes and 50000 operations, c x indicates querying the value of x node, and t x y indicates updating the value of x node and Its subnodes to y... Analysis: it is obvious

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3932 Question: Give a bunch of points and find the least distance between a point and these points... Precision: 0.1   Analysis: This question was originally a template question with the smallest

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4000 For an arrangement of 1 -- N, calculate the number of all I   Analysis: I don't know how to do it during the competition. I always want to simply enumerate I, j, or K to get the result. I

Given a tree, each node has a weight. Given the starting point a, starting from, when each vertex is reached, a weight value of the vertex is obtained (the node is reduced by one) and the maximum number of values can be obtained... Analysis: DFS

Question If all digits are lucky and sum of the digits of the first half equals to the sum of the digits of the second half, then answer is yes, in other case-no.All this can be checked by single loop through all the digits Question B In worst case,

Http://icpc.njust.edu.cn/Problem/Show/1420? Title = easy_task _ Give a string and perform many operations Q l r: output the length of the longest consecutive non-decreasing subsequence C l r p: replace each letter from L to R by letter P ('A'

Http://codeforces.com/contest/127/problem/DPasswordQuestion: enter a string and find the longest substring so that it is both the prefix, suffix, and non-prefix of the original substring. Analysis: If a string is both a prefix and a suffix, it can