2015年08月_linyuxilu

原创暑假集训第四周周六赛动态规划 E相同的塔

题目http://acm.hust.edu.cn/vjudge/contest/view.action?cid=86754#problem/E分析：一个简单的动规，关键是学会人家对数据的处理方法，去好好练习，注意这种思想dp[i+1][j+1]=dp[i+1][j]>dp[i][j+1]?dp[i+1][j]:dp[i][j+1];12345

2015-08-10 11:12:12 309

原创暑假集训第四周周六赛 A - Prime Ring Problem素数环

A - Prime Ring ProblemTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1016DescriptionA ring is compose of n circles as show

2015-08-08 21:32:40 373

原创暑假集训第四周阶段二E - Max Sum最大连续子数组和

E - Max SumTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate t

2015-08-06 21:37:31 367

原创暑假集训第四周阶段二DP A - 最长公共子序列

A - Common SubsequenceTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionA subsequence of a given sequence is the given sequence with

2015-08-06 21:30:44 389

原创暑假集训第四周周三赛 E - Charm Bracelet 最大魅力

E - Charm BraceletTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3624DescriptionBessie has gone to the mall's jewelry st

2015-08-05 21:41:21 310

原创暑假集训第四周周三赛 B - Tiling_easy version骨牌递推

B - Tiling_easy versionTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2501Description有一个大小是 2 x n 的网格，现在需要用2种规格的骨牌铺满，骨牌规格分

2015-08-05 21:36:51 401

原创暑假集训第四周周三赛A - 命运动态规划

A - 命运Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2571Description穿过幽谷意味着离大魔王lemon已经无限接近了！可谁能想到，yifenfei在斩杀了一些虾兵蟹将后，却

2015-08-05 21:22:48 352

原创暑假集训第四周周三赛 D - Pass-Muraille 穿墙贪心

D - Pass-MurailleTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1230DescriptionIn modern day magic shows, passing throug

2015-08-05 21:14:33 670

原创暑假集训第四周周三赛F - Knight Moves 骑士的移动 STL

F - Knight MovesTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1372DescriptionA friend of you is doing research on the Tra

2015-08-05 21:08:58 374

原创暑假集训第三周周六赛 STL D - 胜利大逃亡

D - 胜利大逃亡Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1253DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会. 魔王住

2015-08-04 21:16:48 356

原创暑假集训第四周 DP D - Big Event in HDU 分院

D - Big Event in HDUTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNowadays, we all know that Computer College is the biggest d

2015-08-03 21:41:26 311

原创暑假集训第四周 DP C - Proud Merchants

C - Proud MerchantsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionRecently, iSea went to an ancient country. For such a long ti

2015-08-03 21:33:11 312

原创暑假集训第四周阶段一 DP A - Robberies

A - RobberiesTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe aspiring Roy the Robber has seen a lot of American movies, and

2015-08-03 21:27:42 295

原创暑假集训第四周阶段一 DP 动态规划 B - Bone Collector

B - Bone CollectorDescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , al

2015-08-03 19:39:38 376

原创暑假集训第三周周六赛搜索 F - Oil Deposits 油块

F - Oil DepositsTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1241DescriptionThe GeoSurvComp geologic survey company is r

2015-08-02 14:54:41 479

原创暑假集训第三周周六赛搜索 E - N皇后问题

E - N皇后问题Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2553Description在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许

2015-08-02 14:03:01 364

原创暑假集训第三周周六赛搜索 B - Red and Black红黑瓷片

B - Red and BlackTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1312DescriptionThere is a rectangular room, covered with s

2015-08-02 13:51:30 558

原创暑假集训第三周第二阶段搜索 G - 迷宫问题

G - 迷宫问题Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3984Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0,

2015-08-01 13:58:02 344

linyuxilu的博客