摘要:
K Best Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 7491 Accepted: 1936 ... 阅读全文
摘要:
Texas Triphttp://poj.org/problem?id=3301Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4709 Accepted: 1473 D... 阅读全文
摘要:
一只小蜜蜂...http://acm.hdu.edu.cn/showproblem.php?pid=2044Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Othe... 阅读全文
摘要:
1081. Binary Lexicographic Sequencehttp://acm.timus.ru/problem.aspx?space=1&num=1081Time limit: 0.5 secondMemory limit: 64 MBConsider ... 阅读全文
摘要:
问题一:n条直线在平面上相交所能分割出的平面最多有多少?解:设i条直线所能分割出的平面最多为f(i),则n-1条能分割出f(n-1),n条能分割出f(n)。可以观察得当新增的直线与之前的所有直线均相交且交点重复时有最大增加量为n。因此得到f(n)=f(n-1)+n.再... 阅读全文
摘要:
A - Big binary tree HDU - 6161Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): ... 阅读全文