上一页 1 ··· 24 25 26 27 28 29 30 31 32 ··· 56 下一页
摘要: Problem H 最长子串http://acm.fzu.edu.cn/contest/problem.php?cid=129&sortid=8Accept: 31Submit: 110Time Limit: 3000 mSecMemory Limit : 65536 KBProblem Description问题很简单,给你一个字符串s,问s的子串中不包含s1,s2...sn的最长串有多长。Input输入包含多组数据。第一行为字符串s,字符串s的长度1到10^6次方,第二行是字符串s不能包含的子串个数n,n<=1000。接下来n行字符串,长度不大于100。字符串由小写的英文字符 阅读全文
posted @ 2013-04-29 15:36 Jack Ge 阅读(481) 评论(0) 推荐(0) 编辑
摘要: 1504: ZZ的橱柜http://www.acmore.net/problem.php?id=1504Time Limit:1 SecMemory Limit:64 MBSubmit:315Solved:38SubmitStatusWeb BoardDescriptionZZ不仅喜欢买衣服,还是个吃货,天哪!现在的妹纸是怎么了?╮(╯_╰)╭,ZZ有两个大型橱柜A和B,里面放满了零食,每个橱柜里面有N个方格,每个方格里面放了不同重量的美味,现在ZZ要从A、B里面各取一个方格的美味,可是ZZ不想变得太胖,于是他会尽量的选择重量少的美味,当然不是所有的组合都是ZZ喜欢吃的美味,所以她想了一个特别 阅读全文
posted @ 2013-04-28 18:16 Jack Ge 阅读(353) 评论(0) 推荐(0) 编辑
摘要: Tr ATime Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 11Accepted Submission(s) : 7Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionA为一个方阵,则Tr A表示A的迹(就是主对角线上各项的和),现要求Tr(A^k)%9973。Input数据的第一行是一个T,表示有T组数据。每组数据的第一行有n(2 #include#includeus 阅读全文
posted @ 2013-04-28 13:25 Jack Ge 阅读(3646) 评论(0) 推荐(0) 编辑
摘要: 连连看Time Limit : 20000/10000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 109Accepted Submission(s) : 33Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description“连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两 阅读全文
posted @ 2013-04-28 12:27 Jack Ge 阅读(353) 评论(0) 推荐(0) 编辑
摘要: Big NumberTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encr 阅读全文
posted @ 2013-04-28 08:03 Jack Ge 阅读(218) 评论(0) 推荐(0) 编辑
摘要: Count ColorTime Limit:1000MSMemory Limit:65536KTotal Submissions:29895Accepted:8919DescriptionChosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem.There is a very long board with length L centimeter, L is a posit 阅读全文
posted @ 2013-04-25 10:01 Jack Ge 阅读(2892) 评论(4) 推荐(0) 编辑
摘要: 离散化是程序设计中一个非常常用的技巧,它可以有效的降低时间复杂度。其基本思想就是在众多可能的情况中“只考虑我需要用的值”。下面我将用三个例子说明,如何运用离散化改进一个低效的,甚至根本不可能实现的算法。《算法艺术与信息学竞赛》中的计算几何部分,黄亮举了一个经典的例子,我认为很适合用来介绍离散化思想。这个问题是UVA10173(http://acm.uva.es/p/v101/10173.html),题目意思很简单,给定平面上n个点的坐标,求能够覆盖所有这些点的最小矩形面积。这个问题难就难在,这个矩形可以倾斜放置(边不必平行于坐标轴)。这里的倾斜放置很不好处理,因为我们不知道这个矩形最终会倾斜多 阅读全文
posted @ 2013-04-25 09:32 Jack Ge 阅读(362) 评论(0) 推荐(0) 编辑
摘要: Frequent valuesTime Limit:2000MSMemory Limit:65536KTotal Submissions:11083Accepted:4063DescriptionYou are given a sequence ofnintegersa1, a2, ... , anin non-decreasing order. In addition to that, you are given several queries consisting of indicesiandj(1 ≤ i ≤ j ≤ n). For each query, determine the m 阅读全文
posted @ 2013-04-25 09:29 Jack Ge 阅读(262) 评论(0) 推荐(0) 编辑
摘要: Mayor's postersTime Limit:1000MSMemory Limit:65536KTotal Submissions:32200Accepted:9347DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally 阅读全文
posted @ 2013-04-25 09:02 Jack Ge 阅读(2281) 评论(0) 推荐(0) 编辑
摘要: HotelTime Limit:5000MSMemory Limit:30000KTotal Submissions:1584Accepted:645DescriptionThe "Informatics" hotel is one of the most luxurious hotels from Galaciuc. A lot of tourists arrive or leave this hotel in one year. So it is pretty difficult to keep the evidence of the occupied rooms. B 阅读全文
posted @ 2013-04-25 08:46 Jack Ge 阅读(560) 评论(0) 推荐(0) 编辑
上一页 1 ··· 24 25 26 27 28 29 30 31 32 ··· 56 下一页