{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\n \u003cdiv id\u003d\"problem-body\"\u003e \n \u003cp\u003e给两个长度小于100000的字符串A和B，求出他们的最长公共连续子串。\n\n \u003ch3\u003eInput\u003c/h3\u003e \n \u003cp\u003eThe input contains exactly two lines, each line consists of no more than 250000 lowercase letters, representing a string.\u003c/p\u003e \n \u003ch3\u003eOutput\u003c/h3\u003e \n \u003cp\u003eThe length of the longest common substring. If such string doesn\u0027t exist, print \"0\" instead.\u003c/p\u003e \n \u003ch3\u003eExample\u003c/h3\u003e \n \u003cpre\u003e\u003cstrong\u003eInput:\u003c/strong\u003e\nalsdfkjfjkdsal\nfdjskalajfkdsla\n\n\u003cstrong\u003eOutput:\u003c/strong\u003e\n3\n\u003c/pre\u003e \n \u003cp\u003e\u003cstrong\u003eNotice: new testcases added\u003c/strong\u003e\u003c/p\u003e \n \u003c/div\u003e\n \u003c/body\u003e\n\u003c/html\u003e"}}]}