动态规划
文章平均质量分 78
神牛jianing
省选倒计时
展开
-
HDU2993——MAX Average Problem(斜率优化DP)
MAX Average ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4455 Accepted Submission(s): 1114Problem DescriptionConsider原创 2013-04-24 17:40:14 · 580 阅读 · 0 评论 -
POJ3254——Corn Fields(状态压缩DP)
Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4830Accepted: 2551DescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12;原创 2013-05-16 11:39:19 · 622 阅读 · 0 评论 -
POJ1185——炮兵阵地(状态压缩DP)
炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14787Accepted: 5523Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平原地形上最多原创 2013-05-16 16:59:24 · 609 阅读 · 0 评论 -
SCOI2010——股票交易(单调队列DP)
1855: [Scoi2010]股票交易Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 491 Solved: 209[Submit][Status][Discuss]Description最近lxhgww又迷上了投资股票,通过一段时间的观察和学习,他总结出了股票行情的一些规律。 通过一段时间的观察,lxhgww预测到了原创 2013-05-03 10:57:49 · 1342 阅读 · 2 评论 -
POJ3311——Hie with the Pie(状态压缩DP)
Hie with the PieTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2917Accepted: 1492DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as poss原创 2013-05-16 22:19:52 · 734 阅读 · 0 评论 -
ZOJ3471——Most Powerful(状态压缩DP)
Most PowerfulTime Limit: 2 Seconds Memory Limit: 65536 KBRecently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two原创 2013-05-17 12:10:44 · 668 阅读 · 0 评论 -
SCOI2009——粉刷匠(动态规划)
1296: [SCOI2009]粉刷匠Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 528 Solved: 292[Submit][Status][Discuss]Descriptionwindy有 N 条木板需要被粉刷。 每条木板被分为 M 个格子。 每个格子要被刷成红色或蓝色。 windy每次粉刷,只能选择一条木板原创 2013-05-20 15:26:18 · 1147 阅读 · 0 评论 -
SCOI2008——奖励关(状态压缩DP)
1076: [SCOI2008]奖励关Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 377 Solved: 226[Submit][Status][Discuss]Description你正在玩你最喜欢的电子游戏,并且刚刚进入一个奖励关。在这个奖励关里,系统将依次随机抛出k次宝物,每次你都可以选择吃或者不吃(必须在原创 2013-05-19 20:29:04 · 573 阅读 · 0 评论 -
ZJOI2008——生日聚会(动态规划)
1037: [ZJOI2008]生日聚会PartyTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 755 Solved: 453[Submit][Status][Discuss]Description今天是hidadz小朋友的生日,她邀请了许多朋友来参加她的生日party。 hidadz带着朋友们来到花园中,打算坐成一排原创 2013-05-20 17:17:03 · 1027 阅读 · 0 评论 -
NOI2004——小H的小屋(动态规划)
1505: [NOI2004]小H的小屋Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 102 Solved: 79[Submit][Status][Discuss]Description小H发誓要做21世纪最伟大的数学家。他认为,做数学家与做歌星一样,第一步要作好包装,不然本事再大也推不出去。为此他决定先在自己的住所上原创 2013-05-19 20:39:42 · 1824 阅读 · 0 评论 -
HNOI2008——cards(burnside引理+DP)
1004: [HNOI2008]CardsTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 1025 Solved: 590[Submit][Status][Discuss]Description小春现在很清闲,面对书桌上的N张牌,他决定给每张染色,目前小春只有3种颜色:红色,蓝色,绿色.他询问Sun有多少种染色方案,原创 2013-05-16 09:47:27 · 578 阅读 · 0 评论 -
hdu3530——Subsequence(单调队列优化DP)
SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3213 Accepted Submission(s): 1044Problem DescriptionThere is a seq原创 2013-04-27 19:51:38 · 591 阅读 · 0 评论 -
hdu3555——Bomb(数位DP)
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 3212 Accepted Submission(s): 1142Problem DescriptionThe counter-terrorists原创 2013-04-19 20:07:46 · 557 阅读 · 0 评论 -
hdu2089——不要62(数位DP)
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11631 Accepted Submission(s): 3620Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:原创 2013-04-19 19:56:16 · 592 阅读 · 0 评论 -
poj2096——Collecting Bugs(概率DP)
Collecting BugsTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 1444Accepted: 623Case Time Limit: 2000MSSpecial JudgeDescriptionIvan is fond of collecting. Unlike other people原创 2013-04-17 16:37:23 · 754 阅读 · 1 评论 -
poj2411——Mondriaan's Dream(状态压缩DP)
Mondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8702Accepted: 5024DescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night原创 2013-03-04 22:23:02 · 399 阅读 · 0 评论 -
HDU3045——Picnic Cows(斜率优化DP)
Picnic CowsTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1329 Accepted Submission(s): 396Problem DescriptionIt’s summer vocat原创 2013-04-26 11:09:40 · 516 阅读 · 0 评论 -
SCOI2009——windy数(数位DP)
windy数Time Limit: 1000 ms Memory Limit: 65536 kB Solved: 99 Tried: 695Submit Status Best Solution BackDescriptionwindy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。windy想知道,在A和B之间,包括A和B,总共有多原创 2013-04-22 15:58:27 · 557 阅读 · 0 评论 -
zoj3329——One Person Game(概率DP)
ZOJ Problem Set - 3329One Person GameTime Limit: 1 Second Memory Limit: 32768 KB Special JudgeThere is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2原创 2013-04-18 11:25:46 · 674 阅读 · 0 评论 -
SCOI2005——互不侵犯King(状压DP)
1087: [SCOI2005]互不侵犯KingTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 806 Solved: 445[Submit][Status][Discuss]Description在N×N的棋盘里面放K个国王,使他们互不攻击,共有多少种摆放方案。国王能攻击到它上下左右,以及左上左下右上右下八原创 2013-03-07 21:31:26 · 919 阅读 · 1 评论 -
HNOI2008——玩具装箱toy(斜率优化DP)
1010: [HNOI2008]玩具装箱toyTime Limit: 1 Sec Memory Limit: 162 MBSubmit: 4013 Solved: 1405[Submit][Status][Discuss]DescriptionP教授要去看奥运,但是他舍不下他的玩具,于是他决定把所有的玩具运到北京。他使用自己的压缩器进行压缩,其可以将任意物品变成原创 2013-04-26 21:56:11 · 740 阅读 · 0 评论 -
HDU3001——Travelling(状态压缩DP)
TravellingTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2393 Accepted Submission(s): 692Problem DescriptionAfter coding so many原创 2013-05-17 20:21:33 · 563 阅读 · 0 评论