算法 - 随笔分类(第9页) - ERKE

hdu2222 ac自动机入门

摘要：Keywords SearchTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 27138Accepted Submission(s): 8871 Problem DescriptionIn the modern time, Search engine came into the life of everybody like Google, Baidu, etc. Wiskey also wants to bring this feature 阅读全文

posted @ 2013-08-23 18:54 ERKE 阅读(296) 评论(0) 推荐(0)

hdu4705 Y 2013 Multi-University Training Contest 10

摘要：YTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 304Accepted Submission(s): 104 Problem DescriptionSample Input41 21 31 4Sample Output1Hint1. The only set is {2,3,4}.2. Please use #pragma comment(linker, "/STACK:16777216")一定要构个无向图，不构无向阅读全文

posted @ 2013-08-23 00:37 ERKE 阅读(314) 评论(0) 推荐(0)

hdu4704 Sum 2013 Multi-University Training Contest 10 数论题

摘要：SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 127Accepted Submission(s): 60 Problem DescriptionSample Input2Sample Output2解题思路：很容易看得出，这是个组合数学的插板问题，答案为2^(n-1);由于n特别大，则(2^(n-1))%1000000007=(2^((n-1)%1000000006))%1000000007;因为1000000007为素数，设为p 阅读全文

posted @ 2013-08-22 19:03 ERKE 阅读(414) 评论(0) 推荐(0)

hdu4686 Arc of Dream 2013 Multi-University Training Contest 9矩阵快速幂

摘要：Arc of DreamTime Limit: 2000/2000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 932Accepted Submission(s): 322 Problem DescriptionAn Arc of Dream is a curve defined by following function:where a0= A0 ai= ai-1*AX+AY b0= B0 bi= bi-1*BX+BY What is the value of AoD(N) mo 阅读全文

posted @ 2013-08-21 17:26 ERKE 阅读(312) 评论(0) 推荐(0)

hdu2157矩阵快速幂

摘要：How many ways??Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 954 Accepted Submission(s): 314 Problem Description春天到了, HDU校园里开满了花, 姹紫嫣红, 非常美丽. 葱头是个爱花的人, 看着校花校草竞相开放, 漫步校园, 心情也变得舒畅. 为了多看看这迷人的校园, 葱头决定, 每次上课都走不同的路线去教室, 但是由于时间问题, 每次只能经过k个地方, 比方说, 这.. 阅读全文

posted @ 2013-08-21 15:44 ERKE 阅读(193) 评论(0) 推荐(0)

十大矩阵经典题目（转）

摘要：好像目前还没有这方面题目的总结。这几天连续看到四个问这类题目的人，今天在这里简单写一下。这里我们不介绍其它有关矩阵的知识，只介绍矩阵乘法和相关性质。不要以为数学中的矩阵也是黑色屏幕上不断变化的绿色字符。在数学中，一个矩阵说穿了就是一个二维数组。一个n行m列的矩阵可以乘以一个m行p列的矩阵，得到的结果是一个n行p列的矩阵，其中的第i行第j列位置上的数等于前一个矩阵第i行上的m个数与后一个矩阵第j列上的m个数对应相乘后所有m个乘积的和。比如，下面的算式表示一个2行2列的矩阵乘以2行3列的矩阵，其结果是一个2行3列的矩阵。其中，结果的那个4等于2*2+0*1：下面的算式则是一个1 x 3的矩阵. 阅读全文

posted @ 2013-08-21 15:24 ERKE 阅读(900) 评论(0) 推荐(0)

poj3070矩阵快速幂

摘要：FibonacciTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7752Accepted: 5501DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alternative formul 阅读全文

posted @ 2013-08-21 15:13 ERKE 阅读(154) 评论(0) 推荐(0)

矩阵快速幂（可做模板用）

摘要：矩阵的快速幂是用来高效地计算矩阵的高次方的。将朴素的o（n）的时间复杂度，降到log（n）。这里先对原理（主要运用了矩阵乘法的结合律）做下简单形象的介绍：一般一个矩阵的n次方，我们会通过连乘n-1次来得到它的n次幂。但做下简单的改进就能减少连乘的次数，方法如下：把n个矩阵进行两两分组，比如：A*A*A*A*A*A => (A*A)*(A*A)*(A*A)这样变的好处是，你只需要计算一次A*A，然后将结果(A*A)连乘自己两次就能得到A^6，即(A*A)^3=A^6。算一下发现这次一共乘了3次，少于原来的5次。其实大家还可以取A^3作为一个基本单位。原理都一样：利用矩阵乘法的结合律，来减少阅读全文

posted @ 2013-08-21 14:30 ERKE 阅读(360) 评论(0) 推荐(0)

uva12519

摘要：The Farnsworth Parabox Professor Farnsworth, a renowned scientist that lives in year 3000 working at Planet Express Inc., performed a failed experiment that nearly killed him. As a sub-product, some strange boxes were created. Farnsworth gave one of the boxes to Leela, who accidentally discovered .. 阅读全文

posted @ 2013-08-17 20:10 ERKE 阅读(253) 评论(0) 推荐(0)

hdu1760博弈SG

摘要：A New Tetris GameTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 929Accepted Submission(s): 422 Problem Description曾经，Lele和他姐姐最喜欢，玩得最久的游戏就是俄罗斯方块(Tetris)了。渐渐得，Lele发觉，玩这个游戏只需要手快而已，几乎不用经过大脑思考。所以，Lele想出一个新的玩法。Lele和姐姐先拿出一块长方形的棋盘，这个棋盘有些格子是不可用的，剩下的都是可用阅读全文

posted @ 2013-08-16 22:06 ERKE 阅读(350) 评论(0) 推荐(0)

hdu1524博弈SG

摘要：A Chess GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1100 Accepted Submission(s): 504 Problem DescriptionLet's design a new chess game. There are N positions to hold M chesses in this game. Multiple chesses can be located in the same p 阅读全文

posted @ 2013-08-16 20:18 ERKE 阅读(257) 评论(0) 推荐(0)

hdu1356&hdu1944 博弈论的SG值（王道）

摘要：S-NimProblem DescriptionArthur and his sister Caroll have been playing a game called Nim for some time now. Nim is played as follows:The starting position has a number of heaps, all containing some, not necessarily equal, number of beads.The players take turns chosing a heap and removing a positive. 阅读全文

posted @ 2013-08-16 14:22 ERKE 阅读(288) 评论(0) 推荐(0)

博弈论(转) 挺好的

摘要：以下是我从网上收集的关于组合博弈的资料汇总：有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的法则：如果n=（m+1）r+s，（r为任意. 阅读全文

posted @ 2013-08-16 11:01 ERKE 阅读(188) 评论(0) 推荐(0)

hdu4678 Mine 2013 Multi-University Training Contest 8 博弈题

摘要：MineTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 352 Accepted Submission(s): 94 Problem DescriptionHave you ever played a game in Windows: Mine? This game is played on a n*m board, just like the Pic(1) On the board, Under some grids there ar.. 阅读全文

posted @ 2013-08-16 00:33 ERKE 阅读(489) 评论(0) 推荐(0)

hdu1671字典树

摘要：Phone ListTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7343Accepted Submission(s): 2525 Problem DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone ca 阅读全文

posted @ 2013-08-15 10:34 ERKE 阅读(125) 评论(0) 推荐(0)

hdu1251字典树递归算法

摘要：统计难题Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 13831Accepted Submission(s): 5938 Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatiu 阅读全文

posted @ 2013-08-15 09:29 ERKE 阅读(279) 评论(0) 推荐(0)

poj2337欧拉回路要求输出路径

摘要：CatenymsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8368Accepted: 2202DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms:dog.gopher gopher.rat ra. 阅读全文

posted @ 2013-08-15 00:43 ERKE 阅读(256) 评论(0) 推荐(0)

凸包(转)

摘要：转再出处 http://www.cnblogs.com/Booble/转载请注明出处 http://www.cnblogs.com/Booble/[Poj 1113] 计算几何之凸包(一) {卷包裹算法}{半个寒假都在写凸包这几篇文章整理一下主要介绍二维凸包的求解算法以及一个简单的应用｝====================================================================一.凸集&凸包(下文中所有的集合若不作特殊说明都是指欧氏空间上的集合)凸集(Convex Set):任意两点的连线都在这个集合内的集合就是一个凸集.A set i 阅读全文

posted @ 2013-08-14 19:51 ERKE 阅读(372) 评论(0) 推荐(0)

hdu1116有向图判断欧拉通路判断

摘要：Play on WordsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4263Accepted Submission(s): 1384 Problem DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Becau 阅读全文

posted @ 2013-08-14 17:20 ERKE 阅读(739) 评论(0) 推荐(0)

hdu3018欧拉回路题

摘要：Ant TripTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1107Accepted Submission(s): 404 Problem DescriptionAnt Country consist of N towns.There are M roads connecting the towns.Ant Tony,together with his friends,wants to go through every part of t 阅读全文

posted @ 2013-08-14 15:58 ERKE 阅读(168) 评论(0) 推荐(0)

随笔分类 - 算法