最长公共子序列
亿念之茶
I'm a newbie,but i believe i could fly one day!
展开
-
poj 2250 Compromise(最长公共子序列)
Compromise Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6641 Accepted: 2969 Special Judge http://poj.org/problem?id=2250 Description In a few m原创 2014-12-14 00:09:10 · 410 阅读 · 0 评论 -
nyoj 最长公共子序列
/* 最长公共子序列 时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述 咱们就不拐弯抹角了,如题,需要你做的就是写一个程序,得出最长公共子序列。 tip:最长公共子序列也称作最长公共子串(不要求连续),英文缩写为LCS(Longest Common Subsequence)。其定义是,一个序列 S ,如果分别是两个或多个已知序列的子序列,且是所有符合此条件序原创 2015-03-21 23:51:58 · 466 阅读 · 0 评论 -
hdoj 1423 Greatest Common Increasing Subsequence(最长上升公共子序列)
Greatest Common Increasing Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4801 Accepted Submission(s): 1529 Problem De原创 2015-04-24 20:18:57 · 414 阅读 · 0 评论 -
poj 1458 Common Subsequence(最长公共子序列)
Common Subsequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 39667 Accepted: 15954 http://poj.org/problem?id=1458 Description A subsequence of a g原创 2014-12-13 23:40:33 · 395 阅读 · 0 评论 -
poj 1159 Palindrome(最长公共子序列)
/* Palindrome http://poj.org/problem?id=1159 Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 53898 Accepted: 18618 Description A palindrome is a symmetrical string, that is,原创 2014-12-13 23:01:43 · 433 阅读 · 0 评论