2014年01月_疯狂的橡树

原创 poj 2392 Space Elevator(多重背包)

Space ElevatorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7618 Accepted: 3591DescriptionThe cows are going to space! They plan to achieve orbit by b

2014-01-25 22:48:00 1213

原创 poj 2184 Cow Exhibition(01背包变形)

Cow ExhibitionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8273 Accepted: 3047Description"Fat and docile, big and dumb, they look so stupid, they are

2014-01-25 22:33:10 1317

原创 poj 2479 Maximum sum(dp&最大子段和)

Maximum sumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31468 Accepted: 9665DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a fun

2014-01-25 22:21:08 1351

原创 poj 1742 Coins(多重背包)

CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 26605 Accepted: 9026DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...A

2014-01-25 21:57:48 1120

原创 uva 10003 - Cutting Sticks(dp)

10003 - Cutting SticksTime limit: 3.000 seconds题意：要将一段木头的n(n思路：可以逆向思维。将木头合成一整段。合并花费为合并后的长度。所以可以很快得到O(n^3)的算法。对于n比较小来说完全够用了。dp[i][j]表示合并完[i,j]的最小花费。dp[i][j]=min(dp[i][j],dp[i][k]+

2014-01-25 21:07:29 963

原创 poj 1050 To the Max(最大子矩阵权值)

To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 38220 Accepted: 20161DescriptionGiven a two-dimensional array of positive and negative integer

2014-01-24 21:46:23 1470

原创 uva 10635 - Prince and Princess(线段树)

Problem DPrince and PrincessInput: Standard InputOutput: Standard OutputTime Limit: 3 Seconds In an n x n chessboard, Prince and Princess plays a game. The squares in the chessboard are

2014-01-24 21:33:33 1182

原创 poj 1769 Minimizing maximizer(线段树&dp)

Minimizing maximizerTime Limit: 5000MS Memory Limit: 30000KTotal Submissions: 3118 Accepted: 1224DescriptionThe company Chris Ltd. is preparing a new sorting hard

2014-01-24 21:07:57 1285

原创 poj 2785 4 Values whose Sum is 0(hash)

4 Values whose Sum is 0Time Limit: 15000MS Memory Limit: 228000KTotal Submissions: 14140 Accepted: 4002Case Time Limit: 5000MSDescriptionThe SUM problem can

2014-01-24 20:50:17 1285

原创 poj 2796 Feel Good(单调队列)

Feel GoodTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8598 Accepted: 2324Case Time Limit: 1000MS Special JudgeDescriptionBill is developing

2014-01-24 20:36:25 1379

原创 poj 3262 Protecting the Flowers(贪心)

Protecting the FlowersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3528 Accepted: 1442DescriptionFarmer John went to cut some wood and left N (2 ≤ N

2014-01-21 20:35:55 1424

原创 spoj 417 The lazy programmer（贪心&优先队列）

SPOJ Problem Set (classical)417. The lazy programmerProblem code: LAZYPROGA new web-design studio, called SMART (Simply Masters of ART), employs two people. The first one is a web-designer and an ex

2014-01-21 19:00:03 1321

原创 hdu 1043 poj 1077 Eight Time （搜索&八数码）

EightTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10351 Accepted Submission(s): 2755Special JudgeProblem DescriptionThe 15-pu

2014-01-21 18:32:29 1127

转载八数码问题可解性及扩展

对于给定八数码棋局的初始状态，我们的目标是通过交换空格与其相邻棋子使棋盘达到目标状态。其中，游戏规则是只能交换空格与其上下左右四个方向的相邻棋子。假设棋局目标状态为如下形式：（A、B、C、D、E、F、G、H表示棋子） A B C D E F G H 而初始状态就是A、B、C、D、E、F、G、H这八个棋子在这九个棋格上的任意分布。并且我

2014-01-21 17:53:31 3492

原创 poj 2376 Cleaning Shifts（贪心）

Cleaning ShiftsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9273 Accepted: 2473DescriptionFarmer John is assigning some of his N (1 <= N <= 25,000) c

2014-01-21 15:17:31 1271

原创 uva 1335 Beijing Guards(贪心)

Beijing GuardsTime limit: 3.000 secondsBeijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer City

2014-01-21 14:34:49 1216

原创 poj 3134 Power Calculus(迭代加深dfs)

Power CalculusTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1615 Accepted: 856DescriptionStarting with x and repeatedly multiplying by x, we can com

2014-01-09 23:36:32 1449

原创 poj 1101 The Game(bfs)

The GameTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8640 Accepted: 2632DescriptionOne morning, you wake up and think: "I am such a good programmer.

2014-01-09 23:14:41 1572

原创 poj 3501 Escape from Enemy Territory(预处理&二分&bfs)

Escape from Enemy TerritoryTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2301 Accepted: 637DescriptionA small group of commandos has infiltrated deep

2014-01-09 23:05:34 1268

原创 poj 2046 Gap(dfs&hash&壮压)

GapTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1595 Accepted: 724DescriptionLet's play a card game called Gap. You have 28 cards labeled with two-

2014-01-09 00:05:16 1710

原创 poj 2676 Sudoku (裸dfs&标记)

SudokuTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12594 Accepted: 6275 Special JudgeDescriptionSudoku is a very simple task. A square table with

2014-01-08 23:41:13 1055

记录成长的点点滴滴. . . . .