摘要：
Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39292 Accepted S 阅读全文
摘要：
Advanced Fruits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3595 Accepted Submission(s): 1857 阅读全文
摘要：
Greatest Common Increasing Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8060 Accep 阅读全文
摘要：
B. Mashmokh and Tokens time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Bimokh is Mashmokh 阅读全文
摘要：
D. Mahmoud and a Dictionary time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output D. Mahmoud a 阅读全文
摘要：
Prime Distance Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18618 Accepted: 4984 Description The branch of mathematics called number the 阅读全文
摘要：
B. New Skateboard time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Max wants to buy a new 阅读全文
摘要：
Almost Sorted Array Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 5478 Accepted Submission(s) 阅读全文
摘要：
Constructing Roads In JGShining's Kingdom Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25878 A 阅读全文
摘要：
最长上升子序列（O^n^2）算法 (Onlogn)算法 模板题 http://poj.org/problem?id=2533 阅读全文
摘要：
A - Getting Difference Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement There is a box containing N balls. The i-th ball 阅读全文