摘要: HDU ACM Steps 攻略~ Admin 2011年10月14日 名人名言:一朝开始便永远能够将事业续继下去的人是幸福的。——赫尔克总结了一下ACM STEPS的各章内容,趁便附上我的Steps题号(每人的不一样)。别的,此文首要目标是为了装逼;大牛请疏忽;摸索欲斗劲强的请疏忽;其实不乐于从A+B刷起的可以找到须要的响应题号操练~~ 1.1根蒂根基输入输出:LCY的 A+B 8题(1089~1096) 1.2C说话根蒂根基:根蒂根基入门题(2104,2088,1076,2095,1061,1170,3361,1197) 1.3排序,贪婪:1052 很恶心的一道贪婪题3177 我推荐的.. 阅读全文
posted @ 2012-09-16 21:29 YogyKwan 阅读(257) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(191) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(362) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(278) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(348) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(335) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(204) 评论(0) 推荐(0) 编辑
摘要: 确定比赛名次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 阅读(168) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(167) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(236) 评论(0) 推荐(0) 编辑
摘要: 统计难题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 阅读(192) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(160) 评论(0) 推荐(0) 编辑