2016年3月11日

[2016-03-11][POJ][1887][Testing the CATCHER]

摘要： Testing the CATCHERTime Limit: 1000MSMemory Limit: 30000KB64bit IO Format: %I64d & %I64uSubmit StatusDescriptionA military contractor for the Department of Defense has just completed a series of preli... 阅读全文

posted @ 2016-03-11 20:11 红洋 阅读(189) 评论(0) 推荐(0)

[2016-03-11][POJ][1609][Tiling Up Blocks]

摘要： [2016-03-11][POJ][1609][Tiling Up Blocks]Tiling Up BlocksTime Limit: 1000MSMemory Limit: 10000KB64bit IO Format: %I64d & %I64uSubmit StatusDescriptionMichael The Kid receives an interesting game set f... 阅读全文

posted @ 2016-03-11 19:27 红洋 阅读(171) 评论(0) 推荐(0)

[2016-03-11][POJ][1631][Bridging signals]

摘要： [2016-03-11][POJ][1631][Bridging signals]Bridging signalsTime Limit: 1000MSMemory Limit: 10000KB64bit IO Format: %I64d & %I64uSubmit StatusDescription'Oh no, they've done it again', cries the chief de... 阅读全文

posted @ 2016-03-11 14:58 红洋 阅读(176) 评论(0) 推荐(0)

[2016-03-11][最长上升子序列]

摘要： [2016-03-11][最长上升子序列]O(n^2)算法,动态规划,dp[i]表示到第i个位置,最长子序列的长度,那么就有dp[i] = max(dp[i],dp[j] + 1),(j = 1,2,3,...i && a[i] > a[j]) const int maxn = 1000 + 100; int a[maxn],dp[maxn]; ... 阅读全文

posted @ 2016-03-11 14:19 红洋 阅读(138) 评论(0) 推荐(0)

[2016-03-11][POJ][2533][Longest Ordered Subsequence]

摘要： [2016-03-11][POJ][2533][Longest Ordered Subsequence]Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KB64bit IO Format: %I64d & %I64uSubmit StatusDescriptionA numeric sequence of ai is ... 阅读全文

posted @ 2016-03-11 14:18 红洋 阅读(137) 评论(0) 推荐(0)

导航