摘要：
就是一个文件的很多副本碎成两半， 让你根据所有碎片求出原来的文件排序枚举一下就ok了题目：Question 2: File FragmentationThe ProblemYour friend, a biochemistry major, tripped while carrying a tray of computer files through the lab. All of the files fell to the ground and broke. Your friend picked up all the file fragments and called you to ask 阅读全文
摘要：
一道动态规划 F（x ） = max (F[x-1] + a[x] ,a[x])题目：Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 123249Accepted Submission(s): 28497Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequenc 阅读全文
摘要：
题目就是求能否匹配所有交流生，让他们互相换。 。 一开始第一反应是训练指南上第一道勇士杀龙问题，利用排序比较。。虽然过了但是网上看到一个反例。。就是10 20,20 30,30 10，。。。 一个正确得方法是利用图的思想（有点类似跷跷板。具体看连接中博客吧）题目：Problem EForeign ExchangeInput: standard inputOutput: standard outputTime Limit: 1 secondYour non-profit organization (iCORE - international Confederation ofRevolver En 阅读全文