算法爱好者

摘要： Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 23690Accepted: 10236DescriptionA numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 < 阅读全文

摘要： To The MaxTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4825Accepted Submission(s): 2281Problem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater locat 阅读全文

摘要： 1202 - Bishops PDF (English) Statistics Forum Time Limit: 1 second(s)Memory Limit: 32 MBThere is an Infinite chessboard. Two bishops are there. (Bishop means the chess piece that moves diagonally).Now you are given the position of the two bishops. You have to find the minimum chess moves to take o.. 阅读全文

摘要： Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 4315Accepted Submission(s): 1036Problem DescriptionA lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to 阅读全文

摘要： Turing TreeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1973Accepted Submission(s): 654Problem DescriptionAfter inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have the solu 阅读全文

摘要： Man DownTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1146Accepted Submission(s): 393Problem Des... 阅读全文

摘要： FarmingTime Limit: 12000/6000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 633Accepted Submission(s): 168Problem DescriptionYou have a big farm, and you want to grow vegetables in it. You're too lazy to seed the seeds yourself, so you've hired n people to do 阅读全文

摘要： Get The TreasuryTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1036Accepted Submission(s): 318Problem DescriptionJack knows that there is a great underground treasury in a secret region. And he has a special device that can be used to detect trea 阅读全文

摘要： Tian Ji -- The Horse RacingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10782Accepted Submission(s): 2992Problem DescriptionHere is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the 阅读全文

摘要： Matrix Chain MultiplicationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 620Accepted Submission(s): 426Problem DescriptionMatrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like 阅读全文