The problems of finding a longest common subsequence of two sequences A and B and a shortest edit scr ipt for transforming A into B have long been known to be dual problems. In this paper, they are shown to be equivalent to finding a shortest/longes
Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answer is "b", with the length of 1. Giv en "pwwkew", the answer is "wk
B. Longest Palindrome
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Returning back to problem solving, Gildong is now studying about palindromes. He learned that a palindrome is a string that
题目链接：B. Longest Palindrome
题目
Returning back to problem solving, Gildong is now studying about palindromes. He learned that a palindrome is a string that is the same as its reverse. For example, strings “pop”, “noon”, “x”, and “kkkkkk” are palindrome
