随笔分类 -  动态规划（DP）

上一页 1 2 3 4 下一页
SDUT 飞行棋 (概率DP & 期望)
摘要：飞行棋Time Limit: 1000ms Memory limit: 65536K有疑问？点这里^_^题目描述飞行棋是在一个长度为n的棋盘上走动棋子的游戏。游戏开始时有一个棋子在棋盘的开始，位置是1。然后每一步玩家掷一次骰子，并将棋子往前跳骰子正面大小个格子。当棋子跳出飞行棋的棋盘时游戏结束。问游戏结束时玩游戏的人掷骰子次数的期望。输入第一行输入一个数T代表测试用例组数（T<=200），接下来T组测试用例，每组测试数据为棋盘大小。输出对于每个棋盘，输出玩家要掷骰子次数的期望(结果保留到小数点后4位)。每行输出一个结果。示例输入212示例输出1.00001.1667提示来源示例程序#in 阅读全文
posted @ 2013-05-21 22:58 Jack Ge 阅读(1058) 评论(0) 推荐(0)
ZOJ 3329 One Person Game (概率DP & 期望)
摘要：One Person GameTime Limit:1 Second Memory Limit:32768 KB Special JudgeThere is a very simple and interesting one-person game. You have 3 dice, namelyDie1,Die2andDie3.Die1hasK1faces.Die2hasK2faces.Die3hasK3faces. All the dice are fair dice, so the probability of rolling each value, 1 toK1,K2,K3is exa 阅读全文
posted @ 2013-05-21 22:45 Jack Ge 阅读(899) 评论(1) 推荐(0)
POJ 2096 Collecting Bugs （概率DP & 期望 ）
摘要：Collecting BugsTime Limit:10000MSMemory Limit:64000KTotal Submissions:1485Accepted:647Case Time Limit:2000MSSpecial JudgeDescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he clas 阅读全文
posted @ 2013-05-21 22:19 Jack Ge 阅读(1770) 评论(1) 推荐(0)
POJ 3744 Scout YYF I (概率DP & 期望 + 矩阵乘法)
摘要：Scout YYF ITime Limit:1000MSMemory Limit:65536KTotal Submissions:3871Accepted:975DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficulties, YYF is now at the start of enemy's famous "mine roa 阅读全文
posted @ 2013-05-21 22:06 Jack Ge 阅读(480) 评论(0) 推荐(0)
HDU 4118 Holiday's Accommodation （树形DP 哎，头脑不清晰，没看懂。。。。）
摘要：Holiday's AccommodationTime Limit: 8000/4000 MS (Java/Others)Memory Limit: 200000/200000 K (Java/Others)Total Submission(s): 1457Accepted Submission(s): 380Problem DescriptionNowadays, people have many ways to save money on accommodation when they are on vacation.One of these ways is exchanging 阅读全文
posted @ 2013-05-21 19:33 Jack Ge 阅读(248) 评论(0) 推荐(0)
HDU 4276 The Ghost Blows Light (树形DP)
摘要：The Ghost Blows LightTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1410Accepted Submission(s): 420Problem DescriptionMy name is Hu Bayi, robing an ancient tomb in Tibet. The tomb consists of N rooms (numbered from 1 to N) which are connected by s 阅读全文
posted @ 2013-05-21 19:13 Jack Ge 阅读(352) 评论(0) 推荐(0)
HDU 3586 Information Disturbing （树形DP）
摘要：Information DisturbingTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1018Accepted Submission(s): 376Problem DescriptionIn the battlefield , an effective way to defeat enemies is to break their communication system.The information department told 阅读全文
posted @ 2013-05-21 14:22 Jack Ge 阅读(943) 评论(1) 推荐(0)
HDU 4044 GeoDefense (树形DP 暂时还没解决)
摘要：GeoDefenseTime Limit: 12000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 414Accepted Submission(s): 173Problem DescriptionTower defense is a kind of real-time strategy computer games. The goal of tower defense games is to try to stop enemies from reaching your b 阅读全文
posted @ 2013-05-21 13:57 Jack Ge 阅读(160) 评论(0) 推荐(0)
HDU 4003 Find Metal Mineral （树形DP）
摘要：Find Metal MineralTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1744Accepted Submission(s): 774Problem DescriptionHumans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connecting each of them wh 阅读全文
posted @ 2013-05-21 12:42 Jack Ge 阅读(202) 评论(0) 推荐(0)
HDU 1561 The more, The Better （树形DP）
摘要：The more, The BetterTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3784Accepted Submission(s): 2230Problem DescriptionACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因，有些城堡不能直接攻克，要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多 阅读全文
posted @ 2013-05-21 12:09 Jack Ge 阅读(384) 评论(0) 推荐(0)
HDU 1520 Anniversary party (树形DP)
摘要：Anniversary partyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2668Accepted Submission(s): 1192Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical stru 阅读全文
posted @ 2013-05-21 10:10 Jack Ge 阅读(247) 评论(0) 推荐(0)
HDU Bag Problem (并非0/1背包）
摘要：Bag ProblemTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/131072 K (Java/Others)Total Submission(s): 1011Accepted Submission(s): 308Problem Description0/1 bag problem should sound familiar to everybody. Every earth man knows it well. Here is a mutant: given the capacity of a bag, that is 阅读全文
posted @ 2013-05-19 09:04 Jack Ge 阅读(362) 评论(0) 推荐(0)
HDU 4545 魔法串
摘要：魔法串Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 427Accepted Submission(s): 174Problem Description 小明和他的好朋友小西在玩一个新的游戏，由小西给出一个由小写字母构成的字符串，小明给出另一个比小西更长的字符串，也由小写字母组成，如果能通过魔法转换使小明的串和小西的变成同一个，那么他们两个人都会很开心。这里魔法指的是小明的串可以任意删掉某个字符，或者把某些字符对照字符变化表变化。如： ... 阅读全文
posted @ 2013-05-19 00:22 Jack Ge 阅读(245) 评论(0) 推荐(0)
SDUT 2408 Pick apples
摘要：Pick applesTime Limit: 1000ms Memory limit: 165536K有疑问？点这里^_^题目描述Once ago, there is a mystery yard which only produces three kinds of apples. The number of each kind is infinite. A girl carrying a big bag comes into the yard. She is so surprised because she has never seen so many apples before. Each 阅读全文
posted @ 2013-05-17 18:10 Jack Ge 阅读(589) 评论(0) 推荐(0)
HDU 4512 吉哥系列故事——完美队形I （LCIS）
摘要：吉哥系列故事——完美队形ITime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1302Accepted Submission(s): 360Problem Description 吉哥这几天对队形比较感兴趣。 有一天，有n个人按顺序站在他的面前，他们的身高分别是h[1], h[2] ... h[n]，吉哥希望从中挑出一些人，让这些人形成一个新的队形，新的队形若满足以下三点要求，则称之为完美队形： 1、挑出的人保持他们在原队形的相对顺序不变... 阅读全文
posted @ 2013-05-16 14:29 Jack Ge 阅读(1283) 评论(0) 推荐(0)
数位DP 不断学习中。。。。
摘要：1， HDU 2089 不要62 :http://acm.hdu.edu.cn/showproblem.php?pid=2089题意：不能出现4，或者相邻的62， dp[i][0],表示不存在不吉利数字 dp[i][1],表示不存在不吉利数字，且最高位为2 dp[i][2],表示存在不吉利数字#include<iostream>#include<cstdio>#include<cstring>using namespace std;int dp[10][3];void Init(){ //预处理，算出所有可能 memset(dp,0,sizeof(dp)); 阅读全文
posted @ 2013-05-15 23:32 Jack Ge 阅读(5890) 评论(0) 推荐(1)
HDU 吉哥系列故事——临时工计划
摘要：吉哥系列故事——临时工计划Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1882Accepted Submission(s): 695Problem Description 俗话说一分钱难倒英雄汉，高中几年下来，吉哥已经深深明白了这个道理，因此，新年开始存储一年的个人资金已经成了习惯，不过自从大学之后他不好意思再向大人要压岁钱了，只能把唯一的希望放到自己身上。可是由于时间段的特殊性和自己能力的因素，只能找到些零零碎碎的工作，吉哥想知道怎么安. 阅读全文
posted @ 2013-05-15 16:53 Jack Ge 阅读(370) 评论(0) 推荐(0)
HDU 4501 小明系列故事——买年货 (多维背包)
摘要：小明系列故事——买年货Time Limit: 5000/2000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1479Accepted Submission(s): 636Problem Description 春节将至，小明要去超市购置年货，于是小明去了自己经常去的都尚超市。 刚到超市，小明就发现超市门口聚集一堆人。用白云女士的话说就是：“那家伙，那场面，真是人山人海，锣鼓喧天，鞭炮齐呤，红旗招展。那可真是相当的壮观啊！”。好奇的小明走过去，奋力挤过人群，发现超市门口贴了一张通.. 阅读全文
posted @ 2013-05-15 16:29 Jack Ge 阅读(391) 评论(0) 推荐(0)
状态压缩DP 不断学习中。。。。。。
摘要：HDU 3001 travelling：http://acm.hdu.edu.cn/showproblem.php?pid=3001注意题目叙述：“But Mr Acmer gets bored so easily that he doesn't want to visit a city more than twice!”， 题目大意：加限制的最小生成树，限制条件：每个节点最多只能到达两次， 用三进制（想想二进制表示的意思，可对比理解)#include<iostream>#include<cstdio>#include<cstring>#includ 阅读全文
posted @ 2013-05-14 17:01 Jack Ge 阅读(291) 评论(0) 推荐(0)
Problem F: [USACO 3.1.6]邮票
摘要：Problem F: [USACO 3.1.6]邮票http://www.acmore.net/problem.php?id=1084Time Limit:1 SecMemory Limit:64 MBSubmit:35Solved:13SubmitStatusWeb BoardDescription已知一个 N 枚邮票的面值集合（如，{1 分，3 分}）和一个上限 K —— 表示信封上能够贴 K 张邮票。计算从 1 到 M 的最大连续可贴出的邮资。 例如，假设有 1 分和 3 分的邮票；你最多可以贴 5 张邮票。很容易贴出 1 到 5 分的邮资（用 1 分邮票贴就行了），接下来的邮资也不难： 阅读全文
posted @ 2013-05-01 19:08 Jack Ge 阅读(208) 评论(0) 推荐(0)

上一页 1 2 3 4 下一页