crazy_apple

摘要： Milk PatternsTime Limit:5000MSMemory Limit:65536KTotal Submissions:7938Accepted:3598Case Time Limit:2000MSDescriptionFarmer John has noticed that the quality of milk given by his cows varies from day to day. On further investigation, he discovered that although he can't predict the quality of mi 阅读全文

摘要： http://blog.csdn.net/jokes000/article/details/7839686后缀数组sa：将s的n个后缀从小到大排序后将 排序后的后缀的开头位置顺次放入sa中，则sa[i]储存的是排第i大的后缀的开头位置。简单的记忆就是“排第几的是谁”。名次数组rank：rank[i]保存的是suffix(i)｛后缀｝在所有后缀中从小到大排列的名次。则 若 sa[i]=j，则 rank[j]=i。简单的记忆就是“你排第几”。对于 后缀数组sa 与 名次数组rank ，有rank[ sa[i] ]=i （这是很重要的一点，通过sa与rank的关系可以求出后缀数组）由此可看出，后缀数 阅读全文

摘要： http://www.nocow.cn/index.php/%E5%90%8E%E7%BC%80%E6%95%B0%E7%BB%84后缀数组是字符串处理的一个重要工具。它由原字符串的所有后缀的字典排序而得，具有较高的检索效率。基本概念一、字符串的大小比较： 关于字符串的大小比较，是指通常所说的 “ 字典顺序 ” 比较， 也就是对于两个字符串 u 、v ，令 i 从 1 开始顺次比较 u[i] 和 v[i] ，如果u[i]=v[i] 则令 i 加 1 ，否则若 u[i]v[i] 则认为 u>v，比较结束。如果 i>len(u) 或者 i>len(v) 仍比较不出结果，那么若 l 阅读全文

摘要： Bridging signalsTime Limit:1000MSMemory Limit:10000KTotal Submissions:9234Accepted:5037Description'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 the signals on the chip connecting 阅读全文

摘要： http://poj.org/problem?id=2230WatchcowTime Limit:3000MSMemory Limit:65536KTotal Submissions:5236Accepted:2194Special JudgeDescriptionBessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers are doing any evil. S 阅读全文

摘要： http://poj.org/problem?id=1386Play on WordsTime Limit:1000MSMemory Limit:10000KTotal Submissions:8092Accepted:2848DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors 阅读全文

摘要： CatenymsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8078Accepted:2127DescriptionA 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.gophergopher.ratrat.tiger 阅读全文

摘要： http://poj.org/problem?id=1191棋盘分割Time Limit:1000MSMemory Limit:10000KTotal Submissions:10776Accepted:3791Description将一个８*８的棋盘进行如下分割：将原棋盘割下一块矩形棋盘并使剩下部分也是矩形，再将剩下的部分继续如此分割，这样割了(n-1)次后，连同最后剩下的矩形棋盘共有n块矩形棋盘。(每次切割都只能沿着棋盘格子的边进行)原棋盘上每一格有一个分值，一块矩形棋盘的总分为其所含各格分值之和。现在需要把棋盘按上述规则分割成n块矩形棋盘，并使各矩形棋盘总分的均方差最小。均方差，其中平均 阅读全文

摘要： http://poj.org/problem?id=1426Find The MultipleTime Limit:1000MSMemory Limit:10000KTotal Submissions:14519Accepted:5893Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assu 阅读全文

摘要： http://poj.org/problem?id=1321棋盘问题Time Limit:1000MSMemory Limit:10000KTotal Submissions:17792Accepted:8809Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n <= 8 阅读全文