摘要：
this problem is a very classic problem which can use stack to solve. the problem can be searched through many source site.#include #include//表明要调用关于栈... 阅读全文
摘要：
/*problem: FatMouse' Tradethis is greedy problem.firstly:we should calculate the average J[i]/F[i] and sort itsecondly: according to the m and choose the most high ones*/#include#include#includeusing... 阅读全文