上一页 1 ··· 27 28 29 30 31 32 33 34 35 ··· 43 下一页
摘要: Hdu Girls' DayTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 742Accepted Submission(s): 241Problem DescriptionHdu Girls' Day is a traditional activity in Hdu. Girls in Hdu participate in the activity and show their talent and skill. The gi 阅读全文
posted @ 2012-08-13 19:43 可笑痴狂 阅读(660) 评论(0) 推荐(0)
摘要: 小希的迷宫Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14388Accepted Submission(s): 4378Problem Description上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提 阅读全文
posted @ 2012-08-13 16:49 可笑痴狂 阅读(369) 评论(0) 推荐(0)
摘要: Seek the Name, Seek the FameTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 8261Accepted: 3883DescriptionThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the sam 阅读全文
posted @ 2012-08-13 13:28 可笑痴狂 阅读(3567) 评论(0) 推荐(1)
摘要: KMP算法是一种改进的字符串匹配算法,由D.E.Knuth与V.R.Pratt和J.H.Morris同时发现,因此人们称它为克努特—莫里斯—普拉特操作(简称KMP算法)。这周的数据结构课讲的是串,本以为老师会讲解KMP算法的,谁知到他直接略过了...没办法只能自己研究,这一琢磨就是3天,期间我都有点怀疑自己的智商...不过还好昨天半夜终于想明白了个中缘由,总结一些我认为有助于理解的关键点好了...书上有的东西我就不说了,那些东西网上一搜一大片,我主要说一下我理解的由前缀函数生成的next数组的含义,先贴出求next数组的方法。1234567891011121314151617181920voi 阅读全文
posted @ 2012-08-13 13:21 可笑痴狂 阅读(297) 评论(0) 推荐(0)
摘要: 剪花布条Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4655Accepted Submission(s): 3130Problem Description一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢?Input输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少 阅读全文
posted @ 2012-08-13 11:25 可笑痴狂 阅读(636) 评论(0) 推荐(0)
摘要: Power StringsTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 23370Accepted: 9811DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplica 阅读全文
posted @ 2012-08-13 10:47 可笑痴狂 阅读(439) 评论(0) 推荐(0)
摘要: 一道水题时间限制:1000 ms | 内存限制:65535 KB难度:2描述今天LZQ在玩一种小游戏,但是这游戏数有一点点的大,他一个人玩的累,想多拉一些人进来帮帮他,你能写一个程序帮帮他吗?这个游戏是这样的:有一行数字,如果我们把这行数字中的‘5’都看成空格,那么就得到一行用空格分割的若干非负整数(可能有些整数以‘0’开头,这些头部的‘0’应该被忽略掉,除非这个整数就是由若干个‘0’组成的,这时这个整数就是0)。你的任务是:对这些分割得到的整数,依从小到大的顺序排序输出,大家赶紧写个程序来帮帮LZQ吧!输入输入包含多组测试用例,每组输入数据只有一行数字(数字之间没有空格),这行数字的长度不大 阅读全文
posted @ 2012-08-12 20:36 可笑痴狂 阅读(3428) 评论(0) 推荐(1)
摘要: 产生冠军Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5027Accepted Submission(s): 2409Problem Description有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之间最多打一场比赛。球赛的规则如下:如果A打败了B,B又打败了C,而A与C之间没有进行过比赛,那么就认定,A一定能打败C。如果A打败了B,B又打败了C,而且,C又打败了A,那么A、B、C三者都不可能成为冠军。根据这个规则,无需循环较量,或许就能 阅读全文
posted @ 2012-08-12 20:19 可笑痴狂 阅读(1753) 评论(0) 推荐(0)
摘要: BabelfishTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 24994Accepted: 10703DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.InputInput consist 阅读全文
posted @ 2012-08-10 17:59 可笑痴狂 阅读(364) 评论(0) 推荐(0)
摘要: Colored SticksTime Limit: 5000MSMemory Limit: 128000KTotal Submissions: 24844Accepted: 6542DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of the endpoints that touch 阅读全文
posted @ 2012-08-10 17:06 可笑痴狂 阅读(238) 评论(0) 推荐(0)
上一页 1 ··· 27 28 29 30 31 32 33 34 35 ··· 43 下一页