mac 2009

Title: Give a string of colors, there are two operations, 1. Ask how many blocks of color. 2. Change one color to another.Thought: It seems to be compared with what is dyed, but after looking at the solution, I find it is not so at all.For each color maintained a linked list, and then when modifying the color, the violence changes one color to become another color, with the heuristic combination can ensure that the complexity is not more than O (Nlogn). But because it is a heuristic merge, it ma

Game theoryDoes this count as game theory ...?Orz ZYFSo sad ... Nest IQ is too lowHandling:When n is an even number, it can be completely covered by the 2*1 Domino, so each time you go to the other end of the domino, and the other person can only walk the new dominoes until there is noWhen n is an odd number, the first lattice can be completely covered by the 2*1 Domino, so the outcome is reversed.Qaq IQ Catch an unexpected AH unexpectedly1 /******************************************************

: Enter more than one set of data.The first number of inputs per group is the length of an array of n (1 Output: The values of each input are arranged in order from small to large (there is no space behind the last digit). Sample input: 4-3 75 12-3 Sample output: 1 3 2 1 Topic Analysis: sort + Hash map, the STL map is very useful.

. Check that there are no fewer indexes.(4). Write efficient SQL statements to see if there are any inefficient SQL statements, such as the full connection of the generated Cartesian product, a large number of group by and order by, no limit, and so on. When necessary, the database logic is encapsulated in the DBMS side of the stored procedure. Cache query Results, Explain each SQL statement.(5). All that is required is to fetch only the necessary data from the database, such as querying the num

) { - if(b==0)returnA; + returnGCD (b,a%b); - } + A intSEQ[MAXN]; at Long LongCNT[MAXN],ANSX[MAXN],ANSY[MAXN]; - voidInsertLong Longres,inta) { -res-=cnt[a]*Cnt[a]; -++Cnt[a]; -res+=cnt[a]*Cnt[a]; - } in voidRemoveLong Longres,inta) { -res-=cnt[a]*Cnt[a]; to--Cnt[a]; +res+=cnt[a]*Cnt[a]; - } the intMain () { * intn,m; $scanf"%d%d",n,m);Panax Notoginsengblock=sqrt (n); - for(intI=1; i"%d", seq+i); the for(intI=0; ii) { +Query[i].i=i; Ascanf"%d%d",query[i].l,QUERY[I].R); the

There is a piece of cake. The length is X and the width is Y. Now there are n people who want to divide the cake and ensure that the area of the cake is equal. Evaluate a method to minimize the maximum value of the ratio of the long side to the short side of all cakes. Train of Thought: There is no idea for getting this question. But with a close eye, (n You can directly search for water. Three parameters are passed to indicate the current length and width, and the current block needs to be di

Title describes the number of input inputs that are more than a few of the numbers that are less than B in the lookup sequence A, four rows per groupFirst line: sequence a number nSecond line: n number of (sequence a), ascending orderThird line: Sequence b number MLine four: Number of M (of sequence B) in ascending orderLine five: I denotes number i in BSample input for output to sequence A, the number of outputs less than B31 2 341 2 3 44Sample output3Source2009 Machine Test C question#include

The main topic: give some socks in the order, each time asked how many of the same color in the socks pair.Idea: Mo team algorithm is really a magic algorithm. First, the brute force enumeration is the time complexity of O (n^2), which is certainly not possible. If the interval is guaranteed not to overlap, then the total time transfer complexity can be reduced to O (n). Unfortunately, there is no such guarantee in the title. Thus, the mysterious team invented a magic algorithm.For each inquiry,

The main topic: given n points, each point has a color, m inquiry, each asked a range randomly selected two points the same probability of the same numberOtz-mo Team algorithm ...The specifics of this, whether it's a block or a Manhattan minimum spanning tree, I'm not going to talk about it.The practice of this problem is to record a CNT array representing how many of each color in the current intervalAdd a point with a color of x on ans+=cnt[x] and cnt[x]++Reduce the point of a color x to cnt[x

Recently, many friends asked me how to add a background to the document in WPS 2009. Today's small weave here teaches everybody a small method. Many ways to add a background to a document is to insert a picture and then set it to be lined up underneath the text. The disadvantage of this approach is that each page has to be reset once and often delays to the picture. In fact, the use of a header can make a better background. Click "view → header and

Local 2009-year test results published time and the detailed list of ways to check Area Check Time Method of checking and details Beijing July 6 8 o'clock The results of the exam will be released from 8 o'clock July 6. >> Click to view details / >> Click to check Results Shanghai July 6 18:30 Candidates may enter the Shanghai audition

1. Here first Preheat: Raw Narimoto: Less than 14, and 14 coprime of the number 1, 3, 5, 7, 11, 13, then its generating element is:; number of subgroups: 14 of the factors are: 1, 2, 7, 14, then There are 4 subgroups, respectively: 2. The analysis of the PKU courseware together: ----------------------- the last of the 2009-year real title: My calculation results are | G|=4: Set | G|=n,n have m factors, there are m subgroups (according to

The 2011 Postgraduate Entrance examination has, although do not know the result, here summarizes a lot of people have not understood the place: business Group. Remember that one day in December, the name of the wind called me, and I asked this place by the way. Here to share your personal summary: Quotient group-generated motives: Mathematics is also invented by people, such as set theory, is Canter proposed, although later he was driven crazy by his mentor, but set theory is generally accep

Tqueue and Tstack, one is the list of queues, one is the stack list; One is advanced first out, one is advanced later out. Tqueue has three main methods, one attribute: Enqueue (Row), dequeue (column), Peek (see the next element to be out); Count (total elements). This example effect chart: Code files:Unit Unit1;InterfaceUsesWindows, Messages, sysutils, variants, Classes, Graphics, Controls, Forms,Dialogs, Stdctrls;TypeTForm1 = Class (Tform)Memo1:tmemo;Button1:tbutton;Button2:tbutton;Butt

warriors of the Visual Studio, assemble! (The Warriors of Visual studio, assemble it.) )Original July 12, 2009 19:40:00 Tags: compilation/Microsoft/express/file/assembly/command Warriors of the Visual Studio, assemble! If you ' ve recently purchased Assembly Language for intel-based Computers, 5th edition, you probably want to get the SOFTW is set up so you can start working. This tutorial should make the process easier. If yo

; {先定义一个方法类型} 　function MySqr(const num: Integer): Integer;　{再创建一个吻合上面类型的一个方法} 　begin 　　Result := num * num; 　end; 　{把方法当作参数的方法} 　procedure MyProc(var x: Integer; fun: TFun); 　begin 　　x := fun(x); 　end; {测试} procedure TForm1.FormCreate(Sender: TObject); var 　n: Integer; begin 　n := 9; 　MyProc(n, MySqr); 　ShowMessage(IntToStr(n)); {81} end; end.Now Delphi 2009 can use the anonymous method (use reference to define the method type, and then use the Write

1. Please write out the PHP5 permission control modifier.Answer: Private protected public.2. What are the methods you use to solve traffic problems for large-volume websites?Answer: First, verify that the server hardware is sufficient to support the current traffic.Second, optimize database access.Third, prohibit the external hotlinking.Four, control the download of large files.Five, using different host to divert the main flow of the six, the use of traffic analysis statistics software.3. In HT

The main idea: to give a bad point of the grid diagram, each time moving pieces to the adjacent lattice, the request lattice can not be repeated, ask if there is a winning strategy, if there is, output all the pieces can be placed on the initial position.Idea: A very classic two-figure game model, will be black and white dyeing, it becomes a two-minute map. After the maximum match, if it is on the side of the match, each time the initiator from the left to the right, the hand will be able to com

Title Link: http://www.lydsy.com:808/JudgeOnline/problem.php?id=1026Very basic digital DP problem, I tried to do this problem very early, but I was frightened by this problem, now back to do this problem, feel much simpler.To do this problem, I think of POJ a similar combination of mathematical problems, the same is the number of statistics, there are similarities.The title requires a number of windy on the [a, b] interval, and we can convert the number of windy on the [1,a] windy number of-[1,b

[ -][Ten], A, b;voidPre () { for(inti =0; I 9; i++) f[1][i] =1; for(inti =2; I Ten; i++) { for(intj =0; J 9; J + +) { for(intK =0; K -2; k++) f[i][j] + = F[i-1][K]; for(intK = J+2; K 9; k++) f[i][j] + = F[i-1][K]; }}}ll Get (intx) {inta[ -], tot =0; LL ans =0; while(x) A[++tot] =x%Ten, x/=Ten; for(inti = Tot-1; I >=1; i--) for(intj =1; J 9; J + +) ans + = f[i][j]; for(inti =1; i for(inti = Tot-1, last = A[tot]; I >=1; i--) { for(intj =0; J if(Abs (J-last) 2)Continue; Ans + = f[i][j]; } last