摘要： Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20082 Accepted Submis 阅读全文

摘要： Ignatius and the Princess II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9095 Accepted Submis 阅读全文

摘要： 给定一个无序整型数组arr，找到数组中未出现的最小正整数。要求时间复杂度为O(N)，空间复杂度为常数级。 例如： arr=[33,33,33,33] 返回1 arr=[34,56,45,12] 返回1 arr=[-1,2,3,4] 返回1 arr=[1,2,3,4] 返回5 。。。 随便什么都行 原 阅读全文

摘要： Edge Detection Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 22153 Accepted: 5201 Description IONU Satellite Imaging, Inc. records and st 阅读全文

摘要： Maya Calendar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 79278 Accepted: 24367 Description During his last sabbatical, professor M. A. 阅读全文

摘要： DNA Sorting Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 103246 Accepted: 41368 Description One measure of ``unsortedness'' in a sequenc 阅读全文

摘要： Biorhythms Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 139157 Accepted: 44662 Description Some people believe that there are three cycl 阅读全文

摘要： I Think I Need a Houseboat Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 105313 Accepted: 45877 Description Fred Mapper is considering pu 阅读全文

摘要： Financial Management Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 186714 Accepted: 70910 Description Larry graduated this year and final 阅读全文

摘要： Hangover Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 127403 Accepted: 62236 Description How far can you make a stack of cards overhang 阅读全文