摘要：
Description Most financial institutions had become insolvent during financial crisis and went bankrupt or were bought by larger institutions, usually 阅读全文
摘要：
G - 贪心 Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status G - 贪心 Submit Status Description Simon and Garfunkel Corporation ( 阅读全文
摘要：
Description A set of n<tex2html_verbatim_mark> 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l<tex2ht 阅读全文
摘要：
UVA10382 ：http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=21419 只能说这道题和D题是一模一样的，不过要进行转化，这道题有一道坑，方法一需要使用scanf()输入，还需判断输入的正确性，即scanf()==3。。。 阅读全文
摘要：
原题 UVA10020 :http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19688 经典的贪心问题，区间上贪心当然是右区间越右越好了，当然做区间要小于等于当前待覆盖的位置，我们可以用一个变量begin代表当前待覆盖的区间的左值 阅读全文
摘要：
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6639 Accepted Submission(s): 2514 Problem Descrip 阅读全文
摘要：
恢复内容开始 Description Before the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by 阅读全文
摘要：
原题poj 2299：http://poj.org/problem?id=2299 题意，给你一个数组，去统计它们的逆序数，由于题目中说道数组最长可达五十万，那么O(n^2)的排序算法就不要再想了，归并排序~~~ 这里列出归并的解法： #include <iostream> #include <cs 阅读全文