摘要:
问题描写叙述:对于2,5,3,1,9,4,6,8,7,找出最长上升子序列的个数最长上升子序列定义:对于i<j i,j∈a[0...n] 满足a[i]<a[j]1. 找出DP公式:dp[i] = dp[j] + 1 (j<i && a[j]<a[i] && dp[i] < dp[j]+1)2.实现代码 阅读全文
posted @ 2017-04-22 10:28
yxysuanfa
阅读(224)
评论(0)
推荐(0)
摘要:
使用dbua升级时,须要手工设置CLUSTER_DATABASE參数么? 来源于: Is Manual Setting Of CLUSTER_DATABASE Parameter Required For DBUA Upgrade? (文档 ID 741081.1) 适用于: Oracle Serv 阅读全文
posted @ 2017-04-22 09:29
yxysuanfa
阅读(276)
评论(0)
推荐(0)
摘要:
统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 23029 Accepted Submission(s): 9640 Problem 阅读全文
posted @ 2017-04-22 08:32
yxysuanfa
阅读(174)
评论(0)
推荐(0)

浙公网安备 33010602011771号