随笔分类 -  动态规划

HDU 2045 不容易系列之(3)—— LELE的RPG难题(递归/动态规划)
摘要：不容易系列之(3)—— LELE的RPG难题 Problem Description 人称“AC女之杀手”的超级偶像LELE最近忽然玩起了深沉，这可急坏了众多“Cole”（LELE的粉丝,即"可乐"）,经过多方打探，某资深Cole终于知道了原因，原来，LELE最近研究起了著名的RPG难题:有排成一行 阅读全文
posted @ 2016-02-27 08:51 ACMSaga 阅读(491) 评论(0) 推荐(0)
Super Jumping! Jumping! Jumping!
摘要：Super Jumping! Jumping! Jumping! Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. 阅读全文
posted @ 2016-02-25 12:00 ACMSaga 阅读(266) 评论(0) 推荐(0)
HDU 1003 Max Sum(动态规划)
摘要：Max Sum Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,- 阅读全文
posted @ 2016-02-24 12:05 ACMSaga 阅读(173) 评论(0) 推荐(0)
HDU 1203 I NEED A OFFER!(01背包)
摘要：I NEED A OFFER! Problem Description Speakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。 阅读全文
posted @ 2016-02-22 16:28 ACMSaga 阅读(324) 评论(0) 推荐(0)
HUD 1171 Big Event in HDU(01背包)
摘要：Big Event in HDU Problem Description Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Comp 阅读全文
posted @ 2016-02-22 15:04 ACMSaga 阅读(295) 评论(0) 推荐(0)
HDU 2546 饭卡(01背包)
摘要：饭卡 Problem Description 电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售， 阅读全文
posted @ 2016-02-20 15:45 ACMSaga 阅读(381) 评论(0) 推荐(0)
HDU 2955 Robberies(01背包)
摘要：Robberies Problem Description The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the en 阅读全文
posted @ 2016-02-20 13:28 ACMSaga 阅读(244) 评论(0) 推荐(0)
HDU 2602 Bone Collector(01背包)
摘要：Bone Collector Problem Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect vari 阅读全文
posted @ 2016-02-19 18:28 ACMSaga 阅读(193) 评论(0) 推荐(0)
HDU 1081 To The Max(动态规划)
摘要：题目链接 Problem Description Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or 阅读全文
posted @ 2016-02-09 17:00 ACMSaga 阅读(170) 评论(0) 推荐(0)