HDOJ
Dejavu1z
做题,总结,不断的学习
展开
-
HDOJ 2112(最短路)
题意描述经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车,在什么地方下车(其实徐总自己有车,却一定要与民同乐,这就是徐总的性格)。徐总经常会问蹩脚的英文问路:“Can you help me?”。看着他那原创 2020-07-29 16:10:30 · 150 阅读 · 0 评论 -
HDU 1059(多重背包)
题意描述Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collec原创 2020-07-20 17:36:49 · 114 阅读 · 0 评论 -
POJ 2063(完全背包)
题意描述John never knew he had a grand-uncle, until he received the notary’s letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John was the only inheritor.John did not need that much money for the原创 2020-07-20 16:51:57 · 203 阅读 · 1 评论 -
Coins (多重背包二进制优化)
题意描述Whuacmers use coins.They have coins of value A1,A2,A3…An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known原创 2020-07-20 16:22:28 · 501 阅读 · 0 评论 -
HDU5269 (字典树)
题意描述Memphis loves xor very musch.Now he gets an array A.The length of A is n.Now he wants to know the sum of all (lowbit(Ai xor Aj)) (i,j∈[1,n])We define that lowbit(x)=2k,k is the smallest integer satisfied ((x and 2k)>0)Specially,lowbit(0)=0Becaus原创 2020-07-17 18:14:36 · 114 阅读 · 0 评论 -
HDU3460 (字典树)
题意描述The contest is beginning! While preparing the contest, iSea wanted to print the teams’ names separately on a single paper.Unfortunately, what iSea could find was only an ancient printer: so ancient that you can’t believe it, it only had three kinds o原创 2020-07-17 19:19:56 · 102 阅读 · 0 评论 -
HDU 1867(kmp应用)
题意描述Generally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two strings, such as “asdf” and “sdfg”, the result of the addition between them is “asdfg”, for “sdf” is the tail substring of原创 2020-07-16 16:46:12 · 147 阅读 · 0 评论 -
Gunner II
题意描述Long long ago, there was a gunner whose name is Jack. He likes to go hunting very much. One day he go to the grove. There are n birds and n trees. The i-th bird stands on the top of the i-th tree. The trees stand in straight line from left to the righ原创 2020-07-06 19:51:47 · 169 阅读 · 0 评论 -
Shaolin(map)
题意描述Shaolin temple is very famous for its Kongfu monks.A lot of young men go to Shaolin temple every year, trying to be a monk there. The master of Shaolin evaluates a young man mainly by his talent on understanding the Buddism scripture, but fighting ski原创 2020-07-06 19:40:53 · 233 阅读 · 0 评论 -
POJ3279 (二进制枚举)
题意描述Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N...原创 2020-03-19 20:01:26 · 211 阅读 · 0 评论 -
HDOJ 1018(数论)
题意描述Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you ...原创 2020-03-17 13:43:00 · 166 阅读 · 0 评论 -
HDOJ 1009(贪心)
题意描述Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room co...原创 2020-03-15 09:57:21 · 196 阅读 · 0 评论 -
HDOJ-1711(kmp算法)
题意描述Given two sequences of numbers : a[1], a[2], … , a[N], and b[1], b[2], … , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] ...原创 2020-02-25 18:36:37 · 161 阅读 · 0 评论 -
HDOJ1203(01背包问题,概率DP)
题意Speakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了他得到这个学校offer的可能性b。不同...原创 2020-02-18 13:38:46 · 357 阅读 · 0 评论 -
HDOJ 1087 (JAVA实现 最大上升子序列和dp)
Super Jumping! Jumping! Jumping!原题链接 HDOJ1087Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know l...原创 2020-01-15 22:03:12 · 179 阅读 · 0 评论