09 2012 档案

hdu Counting Sequences
摘要：Counting SequencesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 116 Accepted Submission(s): 41Problem DescriptionFor a set of sequences of integers｛a1，a2，a3，...an｝, we define a sequence｛ai1,ai2,ai3...aik｝in which 1<=i1<i2<i3<...<i 阅读全文
posted @ 2012-09-16 00:51 YogyKwan 阅读(204) 评论(0) 推荐(0)
hdu Interviewe
摘要：IntervieweTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 473 Accepted Submission(s): 119Problem DescriptionYaoYao has a company and he wants to employ m people recently. Since his company is so famous, there are n people coming for the interview. 阅读全文
posted @ 2012-09-16 00:46 YogyKwan 阅读(404) 评论(0) 推荐(0)
hdu Connections between cities
摘要：Connections between citiesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 393 Accepted Submission(s): 118Problem DescriptionAfter World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. However, some materi. 阅读全文
posted @ 2012-09-16 00:42 YogyKwan 阅读(295) 评论(0) 推荐(0)
hdu Median Filter
摘要：Median FilterTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 74 Accepted Submission(s): 31Problem DescriptionMedian filter is a cornerstone of modern image processing and is used extensively inGiven a black and white image of n by n pixels, the a. 阅读全文
posted @ 2012-09-16 00:39 YogyKwan 阅读(367) 评论(0) 推荐(0)
hdu Entropy
摘要：EntropyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 153 Accepted Submission(s): 91Problem Description An entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with “wasted” or “extra” informati. 阅读全文
posted @ 2012-09-16 00:33 YogyKwan 阅读(354) 评论(0) 推荐(0)
hdu Box Relations
摘要：Box RelationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 235 Accepted Submission(s): 92Problem Description There are n boxes C1, C2, ..., Cn in 3D space. The edges of the boxes are parallel to the x, y or z-axis. We provide some relations of . 阅读全文
posted @ 2012-09-16 00:30 YogyKwan 阅读(219) 评论(0) 推荐(0)
hdu 确定比赛名次
摘要：确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 153 Accepted Submission(s): 94Problem Description有N个比赛队（1<=N<=500），编号依次为1，2，3，。。。。，N进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每场比赛的结果，即P1赢P2，用P1，P2表示，排名时P1在P2之前。现在请你编程序确定 阅读全文
posted @ 2012-09-16 00:26 YogyKwan 阅读(188) 评论(0) 推荐(0)
hdu Stock Chase
摘要：Stock ChaseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 159 Accepted Submission(s): 53Problem DescriptionI have to admit, the solution I proposed last year for solving the bank cash crisis didn’t solve the whole economic crisis. As it turns ou. 阅读全文
posted @ 2012-09-16 00:24 YogyKwan 阅读(193) 评论(0) 推荐(0)
hdu Boring counting
摘要：Boring countingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 120 Accepted Submission(s): 52Problem Description035 now faced a tough problem,his english teacher gives him a string,which consists with n lower case letter,he must figure out how ma. 阅读全文
posted @ 2012-09-16 00:15 YogyKwan 阅读(255) 评论(0) 推荐(0)
hdu 统计难题
摘要：统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 165 Accepted Submission(s): 106Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统. 阅读全文
posted @ 2012-09-16 00:11 YogyKwan 阅读(201) 评论(0) 推荐(0)
acm steps chapter5总结
摘要：5.1.1A Bug's Life37.85%(134,354)5.1.2小希的迷宫54.78%(63,115)5.1.3Is It A Tree?38.90%(142,365)5.1.4Farm Irrigation58.23%(46,79)5.1.5Rank of Tetris44.87%(35,78)5.1.6find the most comfortable road51.69%(46,89)5.1.7Dragon Balls53.56%(128,239)5.1.8How Many Answers Are Wrong44.76%(111,248)5.1 并查集及路径压缩5.2. 阅读全文
posted @ 2012-09-16 00:08 YogyKwan 阅读(174) 评论(0) 推荐(0)
hdu Dragon Balls
摘要：Dragon BallsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 232 Accepted Submission(s): 126Problem DescriptionFive hundred years later, the number of dragon balls will increase unexpectedly, so it\\\\\\\'s too difficult for Monkey King(WuKong) 阅读全文
posted @ 2012-09-05 19:45 YogyKwan 阅读(205) 评论(0) 推荐(1)
hdu A Bug's Life
摘要：A Bug's LifeTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 353 Accepted Submission(s): 133Problem DescriptionBackground Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different 阅读全文
posted @ 2012-09-05 19:38 YogyKwan 阅读(979) 评论(0) 推荐(1)
hdu Farm Irrigation
摘要：Farm IrrigationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 79 Accepted Submission(s): 46Problem DescriptionBenny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are p. 阅读全文
posted @ 2012-09-05 19:29 YogyKwan 阅读(240) 评论(0) 推荐(1)
hdu Is It A Tree?
摘要：Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 353 Accepted Submission(s): 140Problem Description A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directe. 阅读全文
posted @ 2012-09-05 19:23 YogyKwan 阅读(192) 评论(0) 推荐(1)
hdu find the most comfortable road
摘要：find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 88 Accepted Submission(s): 45Problem DescriptionXX星有许多城市，城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构）进行交流，每条SARS都对行驶在上面的Flycar限制了固定的Speed，同时XX星人对 Flycar的“舒适. 阅读全文
posted @ 2012-09-05 19:13 YogyKwan 阅读(281) 评论(0) 推荐(1)
bit 最牛的回文
摘要：最牛的回文Description据说，如果有无穷多的母牛和无穷多的大型键盘，它们就可以创造出世界上最伟大的回文。在寻找回文时，可以不计文中的标点、空白和大小写，只要关注26个英文字母就可以了。但是要注意，在输出时要按照原样，也就是要保留原有的空白、标点和大小写。你的任务，就是在不超过20000个字符的字符串中，寻找长度不超过2000的回文字符串（含空格和标点时）。Input一段文本，不超过20000个字符，可以有一行或多行，每行的长度不超过80个字符。Output输出的第一行为找到的最长的回文字符串的长度。后面的行应该包括该字符串，字符串两边多余的空格和标点都不需要输出，但字符串中的空格、标点 阅读全文
posted @ 2012-09-04 23:10 YogyKwan 阅读(489) 评论(0) 推荐(1)
hdu Rank of Tetris
摘要：Rank of TetrisTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 78 Accepted Submission(s): 35Problem Description自从Lele开发了Rating系统，他的Tetris事业更是如虎添翼，不久他遍把这个游戏推向了全球。为了更好的符合那些爱好者的喜好，Lele又想了一个新点子：他将制作一个全球Tetris高手排行榜，定时更新，名堂要比福布斯富豪榜还响。关于如何排名，这个不用说都知道是根据R. 阅读全文
posted @ 2012-09-04 17:34 YogyKwan 阅读(318) 评论(0) 推荐(1)
acm steps chapter4总结
摘要：4.1.1Can you solve this equation?57.63%(238,413)4.1.2Strange fuction86.72%(235,271)4.1.3Pie44.73%(140,313)4.1.4Cup33.56%(145,432)4.1.5find the nth digit38.06%(137,360)4.1.6Turn the corner41.96%(141,336)4.1.7Dome of Circus49.12%(139,283)4.1.8猜数字82.25%(139,169)4.1 二分三分在函数或计算机几何中的应用4.2.1连连看48.65%(54,11 阅读全文
posted @ 2012-09-01 03:01 YogyKwan 阅读(184) 评论(0) 推荐(1)
hdu Dota all stars
摘要：Dota all starsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 81 Accepted Submission(s): 35Problem Description Dota as a popular computer game has serval years. Lots of Dota fans know that the equipment in the game is very important. To get a exc. 阅读全文
posted @ 2012-09-01 02:56 YogyKwan 阅读(395) 评论(0) 推荐(1)
hdu Sequence one
摘要：Sequence oneTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 158 Accepted Submission(s): 49Problem DescriptionSearch is important in the acm algorithm. When you want to solve a problem by using the search method, try to cut is very important. Now . 阅读全文
posted @ 2012-09-01 02:53 YogyKwan 阅读(207) 评论(0) 推荐(1)
hdu Sticks
摘要：SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 206 Accepted Submission(s): 67Problem DescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the . 阅读全文
posted @ 2012-09-01 02:47 YogyKwan 阅读(257) 评论(0) 推荐(1)
hdu Sudoku Killer
摘要：Sudoku KillerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 460 Accepted Submission(s): 169Problem Description自从2006年3月10日至11日的首届数独世界锦标赛以后，数独这项游戏越来越受到人们的喜爱和重视。 据说，在2008北京奥运会上，会将数独列为一个单独的项目进行比赛，冠军将有可能获得的一份巨大的奖品———HDU免费七日游外加lcy亲笔签名以及同hdu acm team合. 阅读全文
posted @ 2012-09-01 02:41 YogyKwan 阅读(551) 评论(0) 推荐(1)
hdu Remainder
摘要：RemainderTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 240 Accepted Submission(s): 65Problem Description Coco is a clever boy, who is good at mathematics. However, he is puzzled by a difficult mathematics problem. The problem is: Given three in. 阅读全文
posted @ 2012-09-01 02:32 YogyKwan 阅读(236) 评论(0) 推荐(1)
hdu Kaitou Kid - The Phantom Thief (2)
摘要：Kaitou Kid - The Phantom Thief (2)Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 67 Accepted Submission(s): 39Problem Description破解字迷之后，你得知Kid将会在展览开始后T分钟内盗取至少一颗宝石，并离开展馆。整个展馆呈矩形分布，划分为N*M个区域，有唯一的入口和出口（不能从出口进入，同样不能从入口出去）。由某个区域可直接移动至相邻四个区域中的一个，且最快需. 阅读全文
posted @ 2012-09-01 02:14 YogyKwan 阅读(312) 评论(0) 推荐(1)
hdu Catch him
摘要：Catch himTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 92 Accepted Submission(s): 38Problem Description在美式足球中，四分卫负责指挥整只球队的进攻战术和跑位，以及给接球员传球的任务。四分卫是一只球队进攻组最重要的球员，而且一般身体都相对比较弱小，所以通常球队会安排5-7名大汉来保护他，其中站在四分卫前方、排成一线的5名球员称为进攻锋线，他们通常都是135公斤左右的壮汉。 对防守方来说. 阅读全文
posted @ 2012-09-01 02:03 YogyKwan 阅读(210) 评论(0) 推荐(1)
hdu Nightmare
摘要：NightmareTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 75 Accepted Submission(s): 39Problem Description Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get. 阅读全文
posted @ 2012-09-01 01:58 YogyKwan 阅读(296) 评论(0) 推荐(1)
hdu Rescue
摘要：RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 521 Accepted Submission(s): 217Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, 阅读全文
posted @ 2012-09-01 01:51 YogyKwan 阅读(404) 评论(0) 推荐(1)