摘要:
NPY and FFT Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 799 Accepted Submission(s): 492 Probl 阅读全文
摘要:
Formula Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1204 Accepted Submission(s): 415 Problem 阅读全文
摘要:
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5138 反着来. 阅读全文
摘要:
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5125 题解: 这个题dp[i][0],dp[i][1]数组分别记录在第i个位置取a[i]和b[i]时可以取到最长上升子序列的长度,然后开一个m[i][0]和m[i][1]分别表示取到第i个位置时最少的 阅读全文