ACagain - 博客园

2017年8月

摘要： The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter ‘e’. He was a member of the Oulipo g... 阅读全文

posted @ 2017-08-07 22:26 ACagain 阅读(78) 评论(0) 推荐(0) 编辑

摘要：多重背包可转化为01背包，首先将件数C二进制分解为多个件数的集合，这些件数可以组合成任意小于等于C的数字，而且不会重复。如7 7=111，可以分解为100,010,001，这三个数可以组合为任意小于等于7的数，而且每种组合都会得到不同的数。 13 13... 阅读全文

posted @ 2017-08-03 18:54 ACagain 阅读(71) 评论(0) 推荐(0) 编辑

2017年7月

摘要： In a two-dimensional plane there are two line belts, there are two segments AB and CD, lxhgww's speed on AB is P and on CD is Q, he c... 阅读全文

posted @ 2017-07-30 22:10 ACagain 阅读(101) 评论(0) 推荐(0) 编辑

摘要： Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in ... 阅读全文

posted @ 2017-07-30 22:07 ACagain 阅读(93) 评论(0) 推荐(0) 编辑

摘要：题目 My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes ... 阅读全文

posted @ 2017-07-30 22:04 ACagain 阅读(114) 评论(0) 推荐(0) 编辑

摘要：题目 For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of his ... 阅读全文

posted @ 2017-07-30 18:49 ACagain 阅读(88) 评论(0) 推荐(0) 编辑

2017年6月

摘要： 51Nod - 1085题目：在N件物品取出若干件放在容量为W的背包里，每件物品的体积为W1，W2……Wn（Wi为整数），与之相对应的价值为P1,P2……Pn（Pi为整数）。求背包能够容纳的最大价值。 Input 第1行，2个整数，N和W中间用空格... 阅读全文

posted @ 2017-06-20 14:35 ACagain 阅读(92) 评论(0) 推荐(0) 编辑

摘要： Description A numeric sequence of ai is ordered if a1 #include #include using namespace std;int num[1005],dp[1005];int main(){ int ... 阅读全文

posted @ 2017-06-05 23:58 ACagain 阅读(101) 评论(0) 推荐(0) 编辑

2017年5月

摘要： HDU 1069 Monkey and Banana(dp)A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana a... 阅读全文

posted @ 2017-05-31 22:36 ACagain 阅读(108) 评论(0) 推荐(0) 编辑