HDU
文章平均质量分 78
安庆闪耀
这个作者很懒,什么都没留下…
展开
-
hdu 5790 Prefix(字典树+主席树)
Problem DescriptionAlice gets N strings. Now she has Q questions to ask you. For each question, she wanna know how many different prefix strings between Lth and Rth strings. It's so easy right? So原创 2016-08-03 16:52:13 · 1035 阅读 · 1 评论 -
hdu 3046 Pleasant sheep and big big wolf(最小割)
Pleasant sheep and big big wolf时间限制2秒 内存限制64MProblemDescriptionIn BIT, there is a well-known prairie. And it attractspleasant sheep and his companions to have a holiday. Big big wolf and his原创 2015-12-23 17:02:32 · 349 阅读 · 0 评论 -
poj 3281 Dining(最大流)
Dining时间限制2秒 内存限制64MDescriptionCows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.Farmer John has cooked fabulous meal原创 2015-12-23 17:06:16 · 280 阅读 · 0 评论 -
hdu 1710 Binary Tree Traversals(二叉树排序)
Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4795 Accepted Submission(s): 2187Problem Description原创 2015-12-24 16:24:46 · 353 阅读 · 0 评论 -
hdu 1757 I Hate It(线段树求区间最值)
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 55716 Accepted Submission(s): 21740Problem Description很多学校流行一种比较原创 2015-12-24 16:29:24 · 296 阅读 · 0 评论 -
hdu 2602 Bone Collector(01背包)
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 42947 Accepted Submission(s): 17894Problem DescriptionMany原创 2015-12-24 16:34:54 · 225 阅读 · 0 评论 -
hdu 1698 Just a Hook(线段树区间更新求和)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24532 Accepted Submission(s): 12230Problem DescriptionIn the g原创 2015-12-24 16:37:03 · 529 阅读 · 0 评论 -
hdu 1007 Quoit Design(最近点对)
Quoit Design时间限制5秒 内存限制64MProblem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In th原创 2015-12-25 11:04:23 · 382 阅读 · 0 评论 -
hdu 5631 Rikka with Graph(并查集)
Rikka with GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 593 Accepted Submission(s): 274Problem DescriptionAs we know,原创 2016-02-27 10:55:17 · 306 阅读 · 0 评论 -
hdu 1423 Greatest Common Increasing Subsequence(最长公共上升子序列dp)
Problem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. InputEach sequence is described with M - its length (1原创 2016-03-01 23:53:27 · 287 阅读 · 0 评论 -
hdu 5115 Dire Wolf(区间dp)
Problem DescriptionDire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to originate from Draenor.Dire wolves look like norma原创 2016-03-06 13:50:01 · 339 阅读 · 0 评论 -
hdu 5122 K.Bro Sorting(单调栈)
Problem DescriptionMatt’s friend K.Bro is an ACMer.Yesterday, K.Bro learnt an algorithm: Bubble sort. Bubble sort will compare each pair of adjacent items and swap them if they are in the wron原创 2016-03-06 13:54:12 · 302 阅读 · 0 评论 -
hdu 5120 Intersection(求相交环面积)
Problem DescriptionMatt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know.A ring is a 2-D figur原创 2016-03-06 13:57:26 · 401 阅读 · 0 评论 -
hdu 5646 DZY Loves Partition(整数拆分)
Problem DescriptionDZY loves partitioning numbers. He wants to know whether it is possible to partition n into the sum of exactly k distinct positive integers.After some thinking he finds this原创 2016-03-22 18:58:20 · 334 阅读 · 0 评论 -
hdu 1016 Prime Ring Problem(dfs)
Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime原创 2016-03-28 16:20:17 · 224 阅读 · 0 评论 -
hdu 1501 Zipper(dfs或dp)
Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitra原创 2016-03-28 17:05:59 · 424 阅读 · 0 评论 -
hdu 1166 敌兵布阵(线段树单点更新求和)
Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视原创 2016-03-30 14:14:50 · 501 阅读 · 0 评论 -
hdu 1754 I Hate It(线段树单点更新求区间最大值)
Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input本题目包含多组测试,请处理到文件结束。在每个测试的第一行,有两个正整数 N原创 2016-03-30 14:17:40 · 442 阅读 · 0 评论 -
hdu 1054 &&poj 1463 Strategic Game(树形dp)
Strategic Game时间限制1秒 内存限制10240KBProblem DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sa原创 2015-12-23 16:52:02 · 516 阅读 · 0 评论 -
hdu 1372 Knight Movies(bfs)
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8854 Accepted Submission(s): 5210Problem DescriptionA friend原创 2015-12-22 23:38:55 · 297 阅读 · 0 评论 -
poj 2421&&hdu 1102 Constructing Roads(最小生成树)
Constructing RoadsDescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two villag原创 2015-12-22 16:59:37 · 528 阅读 · 0 评论 -
hdu 4288 Coder(线段树)
CoderTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4993 Accepted Submission(s): 1920Problem Description In mathematics a原创 2016-06-10 19:25:08 · 763 阅读 · 0 评论 -
hdu 1394 Minimum Inversion Number(线段树)
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16802 Accepted Submission(s): 10219Problem Description原创 2016-06-10 19:16:38 · 782 阅读 · 0 评论 -
hdu 5317 RGCDQ(dp)
RGCDQTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2618 Accepted Submission(s): 1040Problem DescriptionMr. Hdu is intereste原创 2016-06-10 19:12:23 · 498 阅读 · 0 评论 -
5710 Digit-Sum(找规律)
Digit-SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 53 Accepted Submission(s): 22Problem DescriptionLet S(N) be digit-原创 2016-06-10 19:06:09 · 1767 阅读 · 0 评论 -
hdu 5706 GirlCat(dfs)
GirlCatTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 88 Accepted Submission(s): 71Problem DescriptionAs a cute girl, Kotori原创 2016-06-10 19:02:57 · 634 阅读 · 0 评论 -
hdu 5660 jrMz and angles(水题)
Problem DescriptionjrMz has two types of angles, one type of angle is an interior angle of n-sided regular polygon, and the other type of angle is an interior angle of m-sided regular polygon.原创 2016-04-23 09:39:45 · 299 阅读 · 0 评论 -
hdu 5670 Machine(水题)
Problem DescriptionThere is a machine with m(2≤m≤30) coloured bulbs and a button.When the button is pushed, the rightmost bulb changes.For any changed bulb,if it is red now it will be gree原创 2016-04-23 09:37:34 · 305 阅读 · 0 评论 -
hdu 5671 Matrix(模拟)
Problem DescriptionThere is a matrix M that has n rows and m columns (1≤n≤1000,1≤m≤1000).Then we perform q(1≤q≤100,000) operations:1 x y: Swap row x and row y (1≤x,y≤n);2 x y: Swap c原创 2016-04-23 09:35:03 · 420 阅读 · 0 评论 -
hdu 5112 A Curious Matt(排序)
Problem DescriptionThere is a curious man called Matt.One day, Matt's best friend Ted is wandering on the non-negative half of the number line. Matt finds it interesting to know the maximal sp原创 2016-03-06 13:47:04 · 328 阅读 · 0 评论 -
hdu 5655 CA Loves Stick(水题)
Problem DescriptionCA loves to play with sticks.One day he receives four pieces of sticks, he wants to know these sticks can spell a quadrilateral.(What is quadrilateral? Click here: https://e原创 2016-04-10 20:19:46 · 318 阅读 · 0 评论 -
hdu 5650 so easy(水题)
Problem DescriptionGiven an array withnintegers, assume f(S) as the result of executing xor operation among all the elements of set S. e.g. if S={1,2,3} then f(S)=0.your task is: cal原创 2016-04-10 20:28:26 · 489 阅读 · 0 评论 -
poj 2411&&hdu 1400 Mondriaan's Dream(状压DP)
Problem DescriptionSquares and rectangles fascinated the famous Dutch painter PietMondriaan. One night, after producing the drawings in his 'toilet series'(where he had to use his toilet paper to原创 2015-12-19 21:47:22 · 417 阅读 · 0 评论 -
poj 1466 && hdu 1068Girls and Boys(最大独立集)
DescriptionIn the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically involved" is defined between one girl and one原创 2015-12-20 21:04:54 · 817 阅读 · 0 评论 -
hdu 1151 &&poj 1422 Air Raid (二分图匹配 最小路径覆盖)
Air RaidDescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking thr原创 2015-12-20 22:17:25 · 531 阅读 · 0 评论 -
poj 1979 &&hdu 1312Red and Black (bfs)
Red and BlackDescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one原创 2015-12-21 00:07:37 · 561 阅读 · 0 评论 -
hdu 2066 一个人的旅行(最短路)
一个人的旅行Problem Description虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自己的阅历,还可以看美丽的风景……草儿想去很多地方,她想要去东京铁塔看夜景,去威尼斯看电影,去阳明山上看海芋,去纽约纯粹看雪景,去巴黎喝咖啡写信,去北京探望孟姜女……眼看寒原创 2015-12-22 11:18:15 · 775 阅读 · 0 评论 -
poj 1469&&hdu 1803 Courses(最大匹配数)
CoursesProblem DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committ原创 2015-12-22 11:36:09 · 569 阅读 · 0 评论 -
hdu 1698 Just a Hook(线段树成段更新lazy)
Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the sa原创 2016-03-30 14:20:54 · 263 阅读 · 0 评论 -
hdu 3183 A Magic Lamp(ST表)
Problem DescriptionKiki likes traveling. One day she finds a magic lamp, unfortunately the genie in the lamp is not so kind. Kiki must answer a question, and then the genie will realize one of her dre原创 2016-04-10 20:10:23 · 442 阅读 · 0 评论