bodyguard from beijing

I used to be in a small company. Even if I got some technical tickets, I was very busy and didn't have time to attend. Naturally, teched hasn't participated in any of them before. To join teched this time, I would like to thank Han Lei and the blue street lamp for their help. Although I have been in Beijing for a while, I still haven't visited many places. Where is the international conference center where teched is located? Recently, I have to go

A thrilling scene at Beijing bus stop Yesterday, I waited for a bus at the bus stop. A passenger started to get on the bus. When the last passenger was about to get on the bus, the door was closed and the vehicle started and accelerated. the last female was held by the door with both hands and one foot, and the whole body and the other leg were hung out of the car. at this time, passengers waiting for other cars on the platform almost simultaneously

Advertisement of a travel company in Beijing: As long as the price is half a square meter, both Japan and South Korea have played a round; The price of one or two square meters is also back in Europe and America; In the next step, we had to plan to go to Egypt and South Africa; Over the past few years, you have been playing around all over the world and may not have spent the price of a kitchen; But at that time, maybe your world view has changed

In order to find a job toss also counted for a period of time, every day in these square meters of place, brush the brush surface by brush algorithm balabalabalab ....After all, time is limited, and what needs to be prepared is indeed infinite, always find some doorway!!Own things is the best thing, a lot of things have seen the demerit after a few days will certainly blur. It is important to summarize and record. Important things, you may also encounter things to be written down!The general str

is rounded to both decimal places. Sample Input232 430 0 Sample Outputcase #1:2.00Case #2:5.00 Find the average speed for each time period and then output the maximum average speed.1#include 2#include string.h>3#include 4#include 5#include 6 using namespacestd;7 8 structnode{9 intT, POS;Ten}q[10010]; One A BOOLcmpstructNode X,structnode Y) - { - if(x.ty.t) the return 1; - Else return 0; - } - + intMain () - { + intT, N, I, k=1; A Doubles[10010], Maxx; atscanf"%d",

The problem defines a new sort algorithm, which is to put a number in a sequence of sequences, if its right number is smaller than itYou can move to the right of the past until the number on the right is larger than it.Easy to get, if the simulation is O (n^2) efficiency, certainly notThinking about it, this problem can be translated intoFor each element in this sequence, the right side of the string is less than its number and, if present, ++ansI didn't think of it at first. = = should not be1

Title Link: http://acm.hdu.edu.cn/showproblem.php?pid=5112Problem Solving report: Sweep again1#include 2#include 3#include 4#include 5#include 6 using namespacestd;7 Const intMAXN = 1e6+5;8 9 structnodeTen { One Doublet,x; A }REC[MAXN]; - DoubleMax (DoubleADoubleb) - { the returna > B?a:b; - } - BOOLCMP (node A,node b) - { + returnA.T b.t; - } + DoubleFabs (Doubled) A { at returnD >0? d:-1.0*D; - } - intMain () - { - intT,n,kase =1; -scanf"%d",T); in while(t--) - { t

DoubleA =2.0* (x.c.x-y.c.x), B =2.0* (X.C.Y-Y.C.Y), C = y.c.x*y.c.x-x.c.x*x.c.x + y.c.y*y.c.y-x.c.y*x.c.y+x.r*x.r-y.r*Y.R; + DoubleL1 =Dis_line (x.c,a,b,c); - DoubleCo1 = ACOs (L1/X.R) *2.0; the DoubleS1 = PI * x.r*x.r* (co1/pi/2.0) - (0.5*x.r*x.r*sin (co1)); * DoubleL2 =Dis_line (y.c,a,b,c); $ DoubleCO2 = ACOs (L2/Y.R) *2.0, S2;Panax Notoginseng if((a*x.c.x+b*x.c.y+c) * (a*y.c.x+b*y.c.y+c) 0)//Two center on both sides of the garden intersection -S2 = PI * y.r*y.r* (

Title Link: http://acm.hdu.edu.cn/showproblem.php?pid=5122Problem-Solving report: Define a sorting algorithm, each round can be randomly find a number, the number and the subsequent smaller than this number of exchanges, has been judged, until there is no smaller than this number, so called a round, now given a sequence of length n, you ask, at least through how many rounds, you can make this sequence into order.Because we can only compare with the number of the following, so I just need to coun

The main topic: Give a m*n 01 matrix, the following Q queries, the query matrix exists in the size of the K*l sub-matrix.Idea: two-dimensional hash. We first hash the big matrix and then insert all the possible k*l sub-matrices into the hash table, and then just look at the hash tables for each query hash to see if they exist.It is worth mentioning that the problem only requires the output of 10 1 can be AC.CODE:#include Bzoj 2462 Beijing 2011 Matrix

The text of this text connection is: http://blog.csdn.net/freewebsys/article/details/50606441 not allowed to reprint without the Bo master.Bo main address is: Http://blog.csdn.net/freewebsys1, modify the fixed-point hospitalBecause the hospital you chose when you graduated, there is no choice.A few days ago to see a cold, found not a fixed hospital, so to modify the next.However, the site address cannot be found.2, Find methodHttp://jingyan.baidu.com/article/2f9b480d49fdea41ca6cc275.htmlModify t

==MAXN) tail=1; -list[tail]=v,bo[v]=1; the } + } Abo[u]=0; the } + } - intDfsintUintRestinttotval) { $bo[u]=1; $ if(u==t) {totcost+=rest*totval;returnrest;} - intans=0; - for(intP=NOW[U],V=SON[P];p rest;p=pre[p],v=Son[p]) the if(val[p]!bo[v]dis[v]==dis[u]+Cost[p]) { - intD=dfs (V,min (Rest,val[p]), totval+cost[p]);Wuyival[p]-=d,val[p^1]+=d,ans+=d,rest-=D; the } - returnans

} +Sort (dist,dist+m); A Doubler=dist[n-1]; the intInt_r= (int) (r+1); + if(nEPS) - returninf; $ returnInt_r; $ } - intsolve () { - if(n>m)return-1; the intres=inf; - for(intI=0; i) {Wuyires=min (res,choose (p[i)); the } - if(Res==inf) res=-1; Wu returnRes; - } About intMain () { $ #ifdef txtout -Freopen ("In.txt","R", stdin); -Freopen ("OUT.txt","W", stdout); - #endif A intT; + while(~SCANF ("%d",t)) { the while(t--) { -sca

Summer weather is like a child's face, quicker. The day before the scorching sun, in a flash of rain, and it rained for a whole week. But the wind and rain are blocking our study road, shine in the morning eight to enter the classroom study, for the special situation of sudden rainfall, for us these slippers party teachers are also open a eyes closed one eye, and the barefoot in the rain on the road, into the classroom and then change the shoes of the bare feet of the big Fairy, to express heart

Today is my first day of work in Beijing, in short, everything is better than imagined, the entry process of the orderly.2 hours of time, has signed the contract, explained the company's rules and regulations, than my mind to be more formal, ah, worthy of the listed company.After entering the work department, the team leader also specially for our arrival, team Dinner ~ O (∩_∩) o haha ~This afternoon began with the Django development, using the develo

Friday off-duty dragon Boat Festival holiday, steal lazy Bar ~On the eighth day, when the environment became familiar, people began to be scarce and began to be lazy.We're off duty today. A query problem for a Django project that was modified before the upgrade stanza is to use an Ajax asynchronous query to present the data. In this machine good, but put on the server, there is a point can be queried, and then will be reported "undefined" error, there is an unstable situation. All kinds of troub

, learning is too big, not consciously around the classics.) ） Only to say, little friends, you have made a very unwise decision. Because on the brother even this piece of pirate, you do not want to learn knowledge is difficult. Do you think you're going to stand and sleep in class? Have you ever imagined yourself learning PHP UI design HTML5 every day ? Have you ever imagined that everyday glue life will befall you? Prepare yourself for the first. Phpcms two times development price 900 Yuan v

A vulnerability has fallen into eight business systems of Beijing chain home real estate brokerage Co., Ltd. Http://tc.homelink.com.cn/Login.aspxLogin logic vulnerability exists, causing the administrator password to leak. This entry is routed to the internal system of the chain home. Http://tc.homelink.com.cn/login.aspxlogin location username admin password enter casually, click Login, then click training Mall, found that you have logged in with th

Run a command somewhere in the home of Beijing RTDetailed description: Jboss invoker/JMXInvokerServlet Code ExecutionThe http://oa.juran.com.cn: 8086/invoker/JMXInvokerServletProof of vulnerability: Solution: Security suggestion: add an access password to the jmx-console and restrict access to the public network. Check whether the version has any vulnerabilities and whether the upgrade is required.1. Find the jmx-console.war directory edit WEB-INF

Advanced Data StructuresOne, left bias tree oblique heapMerge, INSERT, deleteHit MarkstructNode {intFA,L,R,W,DEP} TREE[MX];intMerge (intK1,intK2)//The return value is the root node{ if(k1==0|| k2==0)returnk1+K2; if(k1.valk2.val) Swap (K1,K2); TREE[K1].R=Merge (TREE[K1].R,K2); TREE[TREE[K1].R].FA=K1; if(tree[tree[k1].l].deptree[tree[k1].r].dep) Swap (TREE[K1].L,TREE[K1].R); if(tree[k1].r==0) tree[k1].dep=0; Elsetree[k1].dep=tree[tree[k1].r].dep+1; returnK1;}Second, line treeBuild, modify, que