2013年7月18日
Poj1207 The 3n + 1 problem(水题(数据)+陷阱)
摘要： 一、DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this ... 阅读全文
posted @ 2013-07-18 22:31 InkGenius 阅读(184) 评论(0) 推荐(0)
Poj1207 The 3n + 1 problem(水题(数据)+陷阱)
摘要： 一、DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this ... 阅读全文
posted @ 2013-07-18 22:31 InkGenius 阅读(173) 评论(0) 推荐(0)
Poj1159 Palindrome(动态规划DP求最大公共子序列LCS)
摘要： 一、DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to wri... 阅读全文
posted @ 2013-07-18 21:20 InkGenius 阅读(143) 评论(0) 推荐(0)
Poj1159 Palindrome(动态规划DP求最大公共子序列LCS)
摘要： 一、DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to wri... 阅读全文
posted @ 2013-07-18 21:20 InkGenius 阅读(138) 评论(0) 推荐(0)
Poj1050_To the Max(二维数组最大字段和)
摘要： 一、DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater locat... 阅读全文
posted @ 2013-07-18 12:23 InkGenius 阅读(128) 评论(0) 推荐(0)
Poj1050_To the Max(二维数组最大字段和)
摘要： 一、DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater locat... 阅读全文
posted @ 2013-07-18 12:23 InkGenius 阅读(162) 评论(0) 推荐(0)