摘要: ChoresTime Limit:3000MSMemory Limit:30000KTotal Submissions:4608Accepted:2146DescriptionFarmer John's family pitches in with the chores during milking, doing all the chores as quickly as possible. At FJ's house, some chores cannot be started until others have been completed, e.g., it is impo 阅读全文
posted @ 2013-04-30 21:34 _log__ 阅读(279) 评论(0) 推荐(0) 编辑
摘要: The Windy'sTime Limit:5000MSMemory Limit:65536KTotal Submissions:3274Accepted:1395DescriptionThe Windy's is a world famous toy factory that ownsMtop-class workshop to make toys. This year the manager receivesNorders for toys. The manager knows that every order will take different amount of h 阅读全文
posted @ 2013-04-30 16:53 _log__ 阅读(143) 评论(0) 推荐(0) 编辑
摘要: AntimonotonicityTime Limit:2000MSMemory Limit:65536KTotal Submissions:2811Accepted:1202DescriptionI have a sequenceFredof lengthncomprised of integers between 1 andninclusive. The elements ofFredare pairwise distinct. I want to find a subsequenceMaryofFredthat is as long as possible and has the prop 阅读全文
posted @ 2013-04-30 16:41 _log__ 阅读(177) 评论(0) 推荐(0) 编辑
摘要: IntervalsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2139Accepted Submission(s): 760 Problem DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.Write a program that:> reads the number of intervals, the 阅读全文
posted @ 2013-04-30 16:27 _log__ 阅读(194) 评论(0) 推荐(0) 编辑