ACM之旅
AndreaQ
除非宇宙爆炸,地球毁灭,战争爆发,而你时日无多,否则,一切还来得及!
展开
-
并查集之 Find函数
发现自己写了两道题都把Find函数写得一塌糊涂。。。一题是没有路径压缩过不了,一题是因为前面写错过弄混了,不三不四的。。。总结很重要啊!!路径压缩:递归写法:int Find (int x){ if(Father[x] != x) { Father[x] = Find(Father[x]);//原来写成Father[x] = Father[Father[x]]了。。 //不断地找到其根节点并更改其原创 2015-06-14 16:52:19 · 1469 阅读 · 0 评论 -
HDU 1213 How Many Tables
Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the fri原创 2015-03-30 19:19:06 · 570 阅读 · 0 评论 -
hdu 1342
Problem DescriptionIn a Lotto I have ever played, one has to select 6 numbers from the set {1,2,...,49}. A popular strategy to play Lotto - although it doesn't increase your chance of winning - is原创 2015-03-22 09:53:23 · 397 阅读 · 0 评论 -
ACM做题过程中的一些小技巧
1.一般用C语言节约空间,要用C++库函数或STL时才用C++;cout、cin和printf、scanf最好不要混用。大数据输入输出时最好不要用cin、cout,防止超时。2.有时候int型不够用,可以用long long或__int64型(两个下划线__)。值类型表示值介于 -2^63 ( -9,223,372,036,854,775,808) 到2^63-1(转载 2015-03-29 17:31:37 · 1065 阅读 · 0 评论 -
hdu1016 Prime Ring Problem
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原创 2015-03-19 21:12:42 · 410 阅读 · 0 评论 -
HDU 1005 Number Sequence
Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).原创 2015-03-15 13:48:33 · 379 阅读 · 0 评论 -
HDU 2546 饭卡
Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,即在购买之前判断余额。如果购买一个商品之前,卡上的剩余金额大于或等于5元,就一定可以购买成功(即使购买后卡上余额为负),否则无法购买(即使金额足够)。所以大家都希望尽量使卡上的余额最少。某天,食堂中有n种菜出售,每种菜可购买一次。已知每种菜的价格以及卡上的余额,问最少可使卡上的余额为多少。原创 2015-02-16 00:10:12 · 437 阅读 · 0 评论 -
动态规划总结之 LIS ,LCS
LIS(Longest Increasing subsequence)含义:一列数中(一般是无序才有研究意义),子序列是递增的(当然也有非下降子序列,递减子序列了,这个就是看子序列的元素间的关系了,>,),要求长度最大的这样的子序列的长度是多少。算法一:O(n*n)1.思路:我们把序列的每个元素都当成递增子序列的最后一个数last(即这个递增子序列的最大的数),用一个数组list[原创 2015-02-14 15:24:08 · 722 阅读 · 0 评论 -
HDU 2639 Bone Collector II
Problem DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't m原创 2015-02-15 23:59:03 · 375 阅读 · 0 评论 -
HDU 1114 Piggy-Bank
Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The原创 2015-02-17 16:07:38 · 412 阅读 · 0 评论 -
HDU 2602 Bone Collector 之01背包
DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave … Th原创 2015-02-09 11:03:14 · 459 阅读 · 0 评论 -
hdu 4277 USACO ORZ
Problem DescriptionLike everyone, cows enjoy variety. Their current fancy is new shapes for pastures. The old rectangular shapes are out of favor; new geometries are the favorite.I. M. Hei, the原创 2015-03-22 19:16:13 · 483 阅读 · 0 评论 -
hdu1238 Substrings
Problem DescriptionYou are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of th原创 2015-03-18 21:12:34 · 417 阅读 · 0 评论 -
HDU 3172 Virtual Friends
Problem DescriptionThese days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, growing their social network (their friends,原创 2015-06-14 16:47:55 · 440 阅读 · 0 评论 -
HDU 1856 More is better
Problem DescriptionMr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requirements.原创 2015-06-11 09:02:34 · 472 阅读 · 0 评论 -
HDU 1325 Is It A Tree?
Problem DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the follow原创 2015-06-09 16:48:42 · 531 阅读 · 0 评论 -
HDU 1232 畅通工程
畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35747 Accepted Submission(s): 18934Problem Description某省调查城镇交通状况,得到现有城镇道路原创 2015-06-09 10:39:01 · 420 阅读 · 0 评论 -
poj 1852 Ants
DescriptionAn army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two a原创 2015-06-18 10:27:07 · 540 阅读 · 0 评论 -
poj 3069 Saruman's Army
DescriptionSaruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known as palantirs, among the tr原创 2015-06-18 23:20:23 · 418 阅读 · 0 评论 -
hdu 3926 Hand in Hand
Problem DescriptionIn order to get rid of Conan, Kaitou KID disguises himself as a teacher in the kindergarten. He knows kids love games and works out a new game called "hand in hand".Initiall原创 2015-06-17 11:03:54 · 658 阅读 · 0 评论 -
HDU 1829 A Bug's Life
Problem DescriptionBackground Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bug原创 2015-06-16 17:20:23 · 385 阅读 · 0 评论 -
poj 迷宫问题
定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。Inpu原创 2015-05-01 19:15:04 · 446 阅读 · 0 评论 -
poj 3162 Prime Path
The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It is a matter of s原创 2015-05-02 21:34:33 · 485 阅读 · 0 评论 -
HDU 1950 Bridging signals
Bridging signals Description 'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up completely, making th原创 2015-02-04 20:56:27 · 518 阅读 · 0 评论 -
poj 2533 Longest Ordered Subsequence
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 35524 Accepted: 15582DescriptionA numeric sequence of ai is ordered if a1 a2原创 2015-02-03 10:47:54 · 415 阅读 · 0 评论 -
poj 1306 combinations
CombinationsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8745 Accepted: 4064DescriptionComputing the exact number of ways that N things can be taken M原创 2015-01-30 15:52:06 · 748 阅读 · 0 评论 -
10405 - Longest Common Subsequence
Given two sequences of characters, print the length of the longest common subsequence of both sequences. For example, the longest common subsequence of the following two sequences:abcdghaedfhris原创 2015-02-01 01:09:40 · 505 阅读 · 0 评论 -
数塔问题
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24591 Accepted Submission(s): 14793Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问原创 2015-01-28 17:10:36 · 969 阅读 · 0 评论 -
ACM中国国家集训队论文集目录(1999-2009)
国家集训队1999论文集陈宏:《数据结构的选择与算法效率——从IOI98试题PICTURE谈起》来煜坤:《把握本质,灵活运用——动态规划的深入探讨》齐鑫:《搜索方法中的剪枝优化》邵铮:《数学模型的建立、比较和应用》石润婷:《隐蔽化、多维化、开放化——论当今信息学竞赛中数学建模的灵活性》杨帆:《准确性、全面性、美观性——测试数据设计中的三要素》周咏基:《论随机化算法的转载 2015-01-13 10:31:24 · 886 阅读 · 0 评论 -
发工资
【BestCoder Round #3 来了!】8月3号19:00~21:00(赛前30分钟停止注册比赛)发工资咯:)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30564 Accepted Sub原创 2014-07-29 15:35:03 · 688 阅读 · 0 评论