其他

Just like find a number in a binary search tree. The only trick is keeping record of the current node's left and right node to get to its child node.Code:/************************************************************************* * Copyright (C) 2008 

Simple problem. Just record the absolute values of the differences will do the job.Code:/************************************************************************* * Copyright (C) 2008 by liukaipeng                                      * * liukaipeng 

At the first look, the hartals can be counted with the principle of inclusion and exclusion. However, this may cause the calculations to expand to O(2^numberof(parties)). In another way, simply simulation will also do the job.Code:/******************

問題描述：不說了，。。。解法：dijkstra+state represented by binary codenotes: if a state must meet "**1**1**"  <=>  （state | "00100100"）==state            and if a state must meet "**0**0**" <=> （state & “11011011” ==state)            so if you

問題描述，尋找一條可以運載最多客人的巴士路徑，求最優解解法:dijkstra,#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<queue>#define INF 200000000using namespace std;typedef pair<int ,int > pii;const int maxn=105;int

The simplest problem ever since...Code:/************************************************************************* * Copyright (C) 2008 by liukaipeng                                      * * liukaipeng at gmail dot com                                 

有12個大小相同的乒乓球，其中只有一個的重量和其他的不同，要求用一台沒有砝碼的天平稱三次找出這個重量不同的球!  一個偶然的機會一位仁兄問我這樣的問題，當時我以為那個球是重的（以前曾做過一道類似的，慣性思維），以為很簡單，後來細想才知道是有難度的，而晚上睡覺簽發了半小時也沒有想通，那天睡覺是伴隨著這個問題進入夢鄉的，還好第二天想出了。大致如下：將球編號 1 2 3 4 5 6 7 8 9 10 11 12 ；分成三組 ；先 1234 與 5678 稱 1 要是相等的話：    

北大ACM題庫習題分類與簡介zz題目分類Posted by fishhead at 2007-01-13 12:44:58.0 --------------------------------------------------------------------------------acm.pku.edu.cn1、   排序1423, 1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840, 2201, 2376, 2377, 2380, 1318, 1

MONITORING theperformance of hosts in your cluster is somewhat a boring task. I'veseen various programs written to access system usage informations withhandmade methods, such as filtering output of commands, or readingfields from files in the '/proc'

We can easily observe that if the drawn number is in range [2, 9], Stan will win, and if it is in range [10, 18], Ollie will win. Suppose that one of Span's win range is [m, n], it can be extend to the next win range of [2*m+1, 2*9*n)]. Thus, the

問題描述：給出ai,ｎi,op字串（分別表示＞和＜），ci，表示Ｓ（ａｉ）＋Ｓ（ａｉ＋１）＋．．．．＋Ｓ（ａｉ＋ｎｉ）＞／＜ｃｉ問是否存在這樣的S問題解法：差分約束，超杯具，我竟然把Ｓ（ａｉ）＋Ｓ（ａｉ＋１）＋．．．．＋Ｓ（ａｉ＋ｎｉ）表示成S(ai+ni)-S[ai],很明顯這是錯的，應該是：S(i)表示i之前（不含i）的連續和，所以上式應表示成S(ai+ni+1)-S(ai)另外由於本題是嚴格的<

問題描述：給出一個含負權的圖，判斷是否存在負圈，bellman ford

The coefficient of x1n1x2n2...xknk is (n, n1)(n-n1, n2)...(n-n1-n2-...-nk-1, nk) = n!/n1!n2!...nk!.Code:/************************************************************************* * Copyright (C) 2008 by liukaipeng                                     

Simple simulation will do the job.Code:/************************************************************************* * Copyright (C) 2008 by liukaipeng                                      * * liukaipeng at gmail dot com                                 

問題描述：給出m,n,t,m表示吃第一種食物的時間，n為第二種的時間，t，為總時間，如果能將t全部用於吃的，那麼就輸出食物數量的最大值，否則在剩餘時間喝啤酒，輸出使喝啤酒的時間最小時的食物數量的最大值，以及喝啤酒的時間，（有點拗口，慢慢體會）解法：完全背包。。。超簡單的題目，做了一個多鐘。。。。原因：一直沒理解好題目，原來問的是啤酒的時間最小時的食物數量的最大值，以及喝啤酒的時間，而不是食物數量最大時的喝啤酒時間的最小值。。。總結：一定要好好看題，理解題目。。。有歧義的時候，寧可慢也不可誤會。。

 問題描述：給出n個石頭，要兩個人輪流著搬動，最終將它們搬走，規則：每個人一次只能移走k塊，(對於每個case,k的取值最多不超過10個)，第一個搬動的人是stan，搬走最後一塊的就是勝利者解法：dp        天啊，一開始以為是博弈。。。暈，。。後來仔細想了想，覺得是隱士圖，用兩個狀態(step,leftStoneNum)進行狀態轉移，轉移的規則是，最後發現可以化簡，並總結出dp方程，一句話，我還是太菜了，不過還好沒看解題報告，獨立解答了！！       

This problem can be solved by a BFS on a graph that modeling the doublet relationships. If the pair of a and b forms a doublet, then there is a edge between a and b in the graph.You can divide the dictionary into portions by word size, then handle

I use the naive string search method that scans for the eight directions at each point in the matrix. Due to the relatively small input size, this method work well enough to get the top 20% ranking.Code:/**********************************************

Really simple problem. However, two points need to be considered:1. ... find the largest string x such that there is a permutation of x that is a (not necessarily continuous) subsequence of a ...2. if there are spaces in the input, ignore them in

Not a difficult problem. Just catenate the lines together and compare the correct and submitted answer will do it well. Unfortunately, the problem statement is misleading: I get WA consistently with a "linesize" of 102, however, it becomes AC when I