01 2013 档案

HDU 1280 前m大的数
摘要：前m大的数http://acm.hdu.edu.cn/showproblem.php?pid=1280Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6323Accepted Submission(s): 2235Problem Description还记得Gardon给小希布置的那个作业么？（上次比赛的1005）其实小希已经找回了原来的那张数表，现在她想确认一下她的答案是否正确，但是整个的答案是很庞大的表，小希只想让你把答案中最大的M个数告诉 阅读全文
posted @ 2013-01-11 16:57 Jack Ge 阅读(268) 评论(0) 推荐(0) 编辑
HDU 1593 find a way to escape
摘要：find a way to escapehttp://acm.hdu.edu.cn/showproblem.php?pid=1593Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 899 Accepted Submission(s): 322 Problem Description一日，话说0068与***泛舟湖上。忽见岸边出现他的一大敌人elnil。0068当然不想落入elnil的魔爪，于是他就得想办法逃脱。这个湖是一个很规则的圆形，半径 阅读全文
posted @ 2013-01-10 17:16 Jack Ge 阅读(228) 评论(0) 推荐(0) 编辑
HDU 1492 The number of divisors(约数) about Humble Numbers
摘要：The number of divisors(约数) about Humble Numbershttp://acm.hdu.edu.cn/showproblem.php?pid=1492Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1780 Accepted Submission(s): 871 Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is c 阅读全文
posted @ 2013-01-10 16:48 Jack Ge 阅读(210) 评论(0) 推荐(0) 编辑
HDU 1495 非常可乐
摘要：非常可乐http://acm.hdu.edu.cn/showproblem.php?pid=1495Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2662 Accepted Submission(s): 1085 Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多 阅读全文
posted @ 2013-01-10 09:29 Jack Ge 阅读(263) 评论(0) 推荐(0) 编辑
HDU 1372 Knight Moves
摘要：Knight Moveshttp://acm.hdu.edu.cn/showproblem.php?pid=1372Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3908 Accepted Submission(s): 2432 Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are t 阅读全文
posted @ 2013-01-09 16:40 Jack Ge 阅读(218) 评论(0) 推荐(0) 编辑
POJ 1015 Jury Compromise
摘要：Jury Compromisehttp://poj.org/problem?id=1015Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 22094Accepted: 5670Special JudgeDescriptionIn Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general public. Every time a trial is se 阅读全文
posted @ 2013-01-09 15:48 Jack Ge 阅读(367) 评论(0) 推荐(0) 编辑
POJ 2479 Maximum sum （双向DP）
摘要：Maximum sumhttp://poj.org/problem?id=2479Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 28485Accepted: 8713DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:Your task is to calculate d(A).InputThe input consists of T(#include#includeusing namespac 阅读全文
posted @ 2013-01-09 09:39 Jack Ge 阅读(311) 评论(0) 推荐(0) 编辑
HDU 2072 单词数
摘要：单词数http://acm.hdu.edu.cn/showproblem.php?pid=2072Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18418 Accepted Submission(s): 4573 Problem Descriptionlily的好朋友xiaoou333最近很空，他想了一件没有什么意义的事情，就是统计一篇文章里不同单词的总数。下面你的任务是帮助xiaoou333解决这个问题。Input有多组数据，每组一行， 阅读全文
posted @ 2013-01-08 23:10 Jack Ge 阅读(218) 评论(0) 推荐(0) 编辑
HDU 2094 产生冠军
摘要：产生冠军http://acm.hdu.edu.cn/showproblem.php?pid=2094Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5538 Accepted Submission(s): 2631 Problem Description有一群人，打乒乓球比赛，两两捉对撕杀，每两个人之间最多打一场比赛。 球赛的规则如下： 如果A打败了B，B又打败了C，而A与C之间没有进行过比赛，那么就认定，A一定能打败C。 如果A打败了B， 阅读全文
posted @ 2013-01-08 22:13 Jack Ge 阅读(250) 评论(0) 推荐(1) 编辑
HDU 1568 Fibonacci
摘要：Fibonaccihttp://acm.hdu.edu.cn/showproblem.php?pid=1568Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2292Accepted Submission(s): 1075Problem Description2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-1]+f[i-2](i 阅读全文
posted @ 2013-01-08 12:24 Jack Ge 阅读(188) 评论(0) 推荐(0) 编辑
POJ 1042 Gone Fishing
摘要：Gone Fishinghttp://poj.org/problem?id=1042Time Limit: 2000MSMemory Limit: 32768KTotal Submissions: 25233Accepted: 7423DescriptionJohn is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-wa 阅读全文
posted @ 2013-01-06 16:14 Jack Ge 阅读(434) 评论(0) 推荐(0) 编辑
HDU 1698 Just a Hook
摘要：Just a Hookhttp://acm.hdu.edu.cn/showproblem.php?pid=1698Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10448 Accepted Submission(s): 5161 Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of 阅读全文
posted @ 2013-01-06 10:44 Jack Ge 阅读(226) 评论(0) 推荐(0) 编辑
HDU 2795 Billboard
摘要：Billboardhttp://acm.hdu.edu.cn/showproblem.php?pid=2795Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5633 Accepted Submission(s): 2580 Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size h*w (h i 阅读全文
posted @ 2013-01-06 10:22 Jack Ge 阅读(211) 评论(0) 推荐(0) 编辑
HDU 1503 Advanced Fruits （最长公共子序列）
摘要：Advanced Fruitshttp://acm.hdu.edu.cn/showproblem.php?pid=1503Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 977 Accepted Submission(s): 466Special JudgeProblem DescriptionThe company "21st Century Fruits" has specialized in creating new 阅读全文
posted @ 2013-01-05 21:27 Jack Ge 阅读(435) 评论(0) 推荐(0) 编辑
HDU 1358 Period （KMP）
摘要：Periodhttp://acm.hdu.edu.cn/showproblem.php?pid=1358Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1537 Accepted Submission(s): 742 Problem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code betwee 阅读全文
posted @ 2013-01-05 16:07 Jack Ge 阅读(431) 评论(0) 推荐(0) 编辑
KMP算法 —— next 数组的应用 --- 前缀中最小循环节，最大重复次数
摘要：在KMP算法的使用中，首要任务就是获取一个字符串的next数组，所以我们得明白next数组的含义（最好的方法是自己弄个例子，在草稿纸上模拟一下），在这里，通俗一点讲，next[k] 表示，在模式串的 k 个字符失配了，然后下一次匹配从 next[k] 开始（next[k] 中保存的是该失配字符的前一个字符在前面出现过的最近一次失配的字符后面的一个字符的位置，有点绕口，自己写个例子看看就明白了，也可以继续往下看，有介绍，然后再自己尝试写写 ）。至于next数组为什么可以用来求重复前缀呢，而且求出来的重复前缀是最小的呢？next数组的求法：void getnext(int len){ ... 阅读全文
posted @ 2013-01-05 15:22 Jack Ge 阅读(6752) 评论(0) 推荐(7) 编辑
HDU 2203 亲和串 （KMP）
摘要：亲和串http://acm.hdu.edu.cn/showproblem.php?pid=2203Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4676 Accepted Submission(s): 2109 Problem Description人随着岁数的增长是越大越聪明还是越大越笨，这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考，因为他在很小的时候就知道亲和串如何判断了，但是发现，现在长大了却不知道怎么去判断亲 阅读全文
posted @ 2013-01-05 15:14 Jack Ge 阅读(471) 评论(0) 推荐(0) 编辑
HDU 1418 抱歉
摘要：抱歉http://acm.hdu.edu.cn/showproblem.php?pid=1418Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2335 Accepted Submission(s): 967 Problem Description非常抱歉，本来兴冲冲地搞一场练习赛，由于我准备不足，出现很多数据的错误，现在这里换一个简单的题目：前几天在网上查找ACM资料的时候，看到一个中学的奥数题目，就是不相交的曲线段分割平面的问题，我已经 阅读全文
posted @ 2013-01-05 14:34 Jack Ge 阅读(453) 评论(0) 推荐(0) 编辑
POJ 1195 Mobile phones
摘要：Mobile phoneshttp://poj.org/problem?id=1195Time Limit: 5000MSMemory Limit: 65536KTotal Submissions: 11696Accepted: 5369DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix w 阅读全文
posted @ 2013-01-04 13:17 Jack Ge 阅读(204) 评论(0) 推荐(0) 编辑
POJ 2299 Ultra-QuickSort （树状数组 或 归并排序）
摘要：Ultra-QuickSorthttp://poj.org/problem?id=2299Time Limit: 7000MSMemory Limit: 65536KTotal Submissions: 30129Accepted: 10760DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elemen 阅读全文
posted @ 2013-01-03 22:20 Jack Ge 阅读(205) 评论(0) 推荐(0) 编辑
HDU 1394 Minimum Inversion Number (归并排序 | 线段树 | 数状数组)
摘要：Minimum Inversion Numberhttp://acm.hdu.edu.cn/showproblem.php?pid=1394Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5566 Accepted Submission(s): 3411 Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the numb 阅读全文
posted @ 2013-01-03 20:15 Jack Ge 阅读(1321) 评论(0) 推荐(0) 编辑
HDU 1166 敌兵布阵 (线段树 & 树状数组)
摘要：敌兵布阵http://acm.hdu.edu.cn/showproblem.php?pid=1166Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22647 Accepted Submission(s): 9878 Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活 阅读全文
posted @ 2013-01-03 16:21 Jack Ge 阅读(183) 评论(0) 推荐(0) 编辑
lower_bound()学习
摘要：函数lower_bound()在first和last中的前闭后开区间进行二分查找，返回大于或等于val的第一个元素位置。如果所有元素都小于val，则返回last的位置举例如下：一个数组number序列为：4,10,11,30,69,70,96,100.设要插入数字3,9,111.pos为要插入的位置的下标则pos = lower_bound( number, number + 8, 3) - number，pos = 0.即number数组的下标为0的位置。pos = lower_bound( number, number + 8, 9) - number， pos = 1，即number数组 阅读全文
posted @ 2013-01-03 14:24 Jack Ge 阅读(551) 评论(0) 推荐(0) 编辑
HDU Leftmost Digit
摘要：Leftmost Digithttp://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2&sectionid=1&problemid=11Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1524 Accepted Submission(s): 689Problem DescriptionGiven a positive integer N, you should o 阅读全文
posted @ 2013-01-03 12:26 Jack Ge 阅读(2260) 评论(0) 推荐(0) 编辑
HDU 1286 找新朋友 （欧拉函数）
摘要：找新朋友http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2&sectionid=1&problemid=8Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1560 Accepted Submission(s): 781Problem Description新年快到了，“猪头帮协会”准备搞一个聚会，已经知道现有会员N人，把会员从1到N编号，其中会长的号码是N 阅读全文
posted @ 2013-01-03 12:16 Jack Ge 阅读(1981) 评论(0) 推荐(0) 编辑
HDU Largest prime factor
摘要：Largest prime factorhttp://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2&sectionid=1&problemid=5Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2728 Accepted Submission(s): 860Problem DescriptionEverybody knows any number can be c 阅读全文
posted @ 2013-01-03 11:10 Jack Ge 阅读(682) 评论(0) 推荐(0) 编辑
HDU 1717 小数化分数2
摘要：小数化分数2http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2&sectionid=1&problemid=12Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1646 Accepted Submission(s): 613Problem DescriptionRay 在数学课上听老师说，任何小数都能表示成分数的形式，他开始了化了起来，很快他就完成了，但他 阅读全文
posted @ 2013-01-02 22:55 Jack Ge 阅读(523) 评论(0) 推荐(0) 编辑
HDU 相遇周期
摘要：相遇周期http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2&sectionid=1&problemid=3Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1501 Accepted Submission(s): 710Problem Description 2007年3月26日，在中俄两国元首的见证下，中国国家航天局局长孙来燕与俄罗斯联邦航天局局长别尔米诺 阅读全文
posted @ 2013-01-02 17:06 Jack Ge 阅读(1204) 评论(0) 推荐(0) 编辑
HDU Wooden Sticks
摘要：Wooden Stickshttp://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=1&sectionid=3&problemid=16Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1480 Accepted Submission(s): 595Problem Description There is a pile of n wooden sticks. The 阅读全文
posted @ 2013-01-02 16:13 Jack Ge 阅读(951) 评论(0) 推荐(0) 编辑
HDU Moving Tables
摘要：Moving Tableshttp://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=1&sectionid=3&problemid=2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2435 Accepted Submission(s): 711Problem DescriptionThe famous ACM (Advanced Computer Maker) C 阅读全文
posted @ 2013-01-02 14:30 Jack Ge 阅读(420) 评论(0) 推荐(0) 编辑
HDU 1874 畅通工程续 (Dijkstra , Floyd , SPFA, Bellman_Ford 四种算法)
摘要：畅通工程续http://acm.hdu.edu.cn/showproblem.php?pid=1874Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15713 Accepted Submission(s): 5371 Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人 阅读全文
posted @ 2013-01-01 16:15 Jack Ge 阅读(5893) 评论(1) 推荐(1) 编辑
SDUT 2538 Lucky Transformation
摘要：---恢复内容开始---Lucky Transformationhttp://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2538Time Limit: 1000MS Memory limit: 65536K题目描述ZYJ非常喜欢幸运数字4，和7，他认为只要是只含有4和7的数字就是幸运的。比如，4,47，4477,7都是幸运的，427就不是。 现在有一个n位没有前导零的数字d，从最高位认为是第一位。ZYJ想看看这个数字能否经得起变化.如果这个数字里面有一个连着的“47”，那么就做这样的操作：如果4的位数 阅读全文
posted @ 2013-01-01 15:54 Jack Ge 阅读(253) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示