其他

題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1704原題：Your non-profit organization (iCORE - international Confederation of Revolver Enthusiasts) coordinates a very

題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1768原題：A grid that wraps both horizontally and vertically is called a torus. Given a torus where each cell contains an

439 - Knight Moves1338156.27%515793.21%題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=105&page=show_problem&problem=380題目類型： 搜尋範例輸入：e2 e4a1 b2b2 c3a1 h8a1 h7h8 a1b1 c3f6 f6範例輸出：To get from e2 to e4

連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=206原題：``How am I ever going to solve this problem?" said the pilot.Indeed, the pilot was not facing an easy task. She had

208 - Firetruck667516.87%153454.76%題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=144類型： 回溯法原題：The Center City fire department collaborates with the transportation

今天在寫一個資料結構實驗時， 動態分配了一個數組：bool *vis = new bool[N];然後初始化這個vis數組：memset(vis, 0, sizeof(vis));結果導致一直出不來實驗的結果。最終發現了原因：vis是一個指標，所以sizeof(vis)的結果是4.

572 - Oil Deposits1115858.77%551195.30%題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=105&page=show_problem&problem=513題目類型： 搜尋範例輸入：1 1*3 5*@*@***@***@*@*1 8@@****@*5 5****@*@@*@*@**@@@@*@@@**@0

點擊開啟連結題目大意：給一個字串，每次可以刪除一個可不連續迴文子串，問最少刪幾次可以全部刪完。思路：因為字串長度最大16，所以可用二進位狀態表示， 1表示選取這個字元，0不選，組成一個子串。先預先處理出所有狀態，看這個狀態是不是迴文。f[i]表示狀態i最少幾次可以全刪完， 初始化f數組INFf[i] = min{f[i], f[s]+1 } s是i的子集。 #include<iostream>#include<cstdio>#include<cstring>#

題目連結:http://poj.org/problem?id=1659類型： 貪心，Havel-Hakimi定理題目：Description未名湖附近共有N個大小湖泊L1, L2, ..., Ln(其中包括未名湖)，每個湖泊Li裡住著一隻青蛙Fi(1 ≤ i ≤ N)。如果湖泊Li和Lj之間有水路相連，則青蛙Fi和Fj互稱為鄰居。現在已知每隻青蛙的鄰居數目x1, x2, ..., xn，請你給出每兩個湖泊之間的相連關係。Input第一行是測試資料的組數T(0 ≤ T ≤

連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2267/* 《演算法競賽入門經典-訓練指南》 第一章 例題1 排序+貪心 by shuangde*/#include<cstdio>#include<algorithm>#define REP(i,

連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1661原題：Graph is a collection of edges E and vertices V. Graph has a wide variety of applications in computer. There are

連結：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3587題目大意：給字串S，T，   找到所有的tetrad (a,b,c,d)， Sa..b + Sc..d = T , a≤b and

連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=961類型： 貪心原題：The ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the

題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1846類型： 排序There are lots of number games for children. These games are pretty easy to play but not so easy to make. We

連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1895原題：Yup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to

657 - The die is cast515924.66%135770.23%題目連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=105&page=show_problem&problem=598題目類型： 搜尋範例輸入：30 15...........................................................

題目連結:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=448類型： 最大連續和原題:Jill likes to ride her bicycle, but since the pretty city of Greenhills where she lives has grown, Jill

點擊開啟連結思路：經典的狀態壓縮題，我是來存代碼的#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#include<queue>using namespace std;typedef long long int64;const int INF = 0x3f3f3

連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=44原題：BackgroundA problem that is simple to solve in one dimension is often much more difficult to solve in more than one

連結：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2829/* 劉汝佳《訓練指南》第一章 例題2 UVa 11729 Commando War 貪心 , 用“相鄰交換法”證明正確性 ------ by shuangde