摘要:
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 我推荐的.. 阅读全文
摘要:
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 阅读全文
摘要:
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. 阅读全文
摘要:
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. 阅读全文
摘要:
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. 阅读全文
摘要:
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. 阅读全文
摘要:
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 . 阅读全文
摘要:
确定比赛名次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之前。现在请你编程序确定 阅读全文
摘要:
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. 阅读全文
摘要:
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. 阅读全文