摘要:
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 阅读全文