随笔分类 -  杭电ACM—dp

杭电2955（01背包）
摘要：RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11119Accepted Submission(s): 4121Problem ... 阅读全文
posted @ 2014-07-15 12:04 小叶叶 阅读(296) 评论(0) 推荐(0)
杭电2059（dp）
摘要：龟兔赛跑Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10936Accepted Submission(s): 4099Problem Descr... 阅读全文
posted @ 2014-07-14 23:08 小叶叶 阅读(310) 评论(0) 推荐(0)
杭电1158
摘要：Employment PlanningTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3515Accepted Submission(s): 14... 阅读全文
posted @ 2014-07-14 16:51 小叶叶 阅读(196) 评论(0) 推荐(0)
杭电4826（动态规划）
摘要：Problem Description度度熊是一只喜欢探险的熊，一次偶然落进了一个m*n矩阵的迷宫，该迷宫只能从矩阵左上角第一个方格开始走，只有走到右上角的第一个格子才算走出迷宫，每一次只能走一格，且只能向上向下向右走以前没有走过的格子，每一个格子中都有一些金币（或正或负，有可能遇到强盗拦路抢劫，度... 阅读全文
posted @ 2014-05-31 23:52 小叶叶 阅读(243) 评论(0) 推荐(0)
杭电1081（动态规划）
摘要：题目：Problem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or gr... 阅读全文
posted @ 2014-05-30 16:33 小叶叶 阅读(231) 评论(0) 推荐(0)
杭电1050（贪心）
摘要：题目：The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms e... 阅读全文
posted @ 2014-05-27 12:38 小叶叶 阅读(379) 评论(0) 推荐(0)
杭电1010（dfs + 奇偶剪枝）
摘要：题目：The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie coul... 阅读全文
posted @ 2014-05-22 12:33 小叶叶 阅读(192) 评论(0) 推荐(0)
杭电1085（多重背包求解）
摘要：题目：We all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recently, it is reported that he hides in Hang Zho... 阅读全文
posted @ 2014-05-20 14:37 小叶叶 阅读(102) 评论(0) 推荐(0)
杭电1248（完全背包求解）
摘要：题目：不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前.死亡骑士:"我要买道具!"地精商人:"我们这里有三种道具,血瓶150块一个,魔法药200块一个,无敌药水350块一个."死亡骑士:"好的,给... 阅读全文
posted @ 2014-05-20 10:04 小叶叶 阅读(380) 评论(0) 推荐(0)
杭电1171（01背包求解）
摘要：题目：Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College ha... 阅读全文
posted @ 2014-05-19 12:53 小叶叶 阅读(167) 评论(0) 推荐(0)
杭电2546（01背包求解）
摘要：题目：电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡... 阅读全文
posted @ 2014-05-18 23:14 小叶叶 阅读(181) 评论(0) 推荐(0)
杭电1231
摘要：1题目：给定K个整数的序列{ N1, N2, ..., NK }，其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj }，其中 1 2 3 int main(){ 4 int n, a[10001], left, beforeleft, right, i, max, sum;... 阅读全文
posted @ 2014-05-05 23:29 小叶叶 阅读(161) 评论(0) 推荐(0)
杭电1421
摘要：1题目：Problem Description搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会... 阅读全文
posted @ 2014-05-05 23:18 小叶叶 阅读(214) 评论(0) 推荐(0)
杭电1069
摘要：题目Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building,... 阅读全文
posted @ 2014-05-05 23:03 小叶叶 阅读(309) 评论(0) 推荐(0)