From 38c3397b636202bad7b081efee7159d34bab6283 Mon Sep 17 00:00:00 2001
From: Kirito <1362050620@qq.com>
Date: Fri, 19 Aug 2016 09:44:07 +0800
Subject: [PATCH] Last version of LCS Template is wrong. Now it's right.

---
 .ACM-Templates/LCS.cpp | 59 +++++++++++++++++++++---------------------
 1 file changed, 29 insertions(+), 30 deletions(-)

diff --git a/.ACM-Templates/LCS.cpp b/.ACM-Templates/LCS.cpp
index 5660cc4..5c19c0d 100644
--- a/.ACM-Templates/LCS.cpp
+++ b/.ACM-Templates/LCS.cpp
@@ -1,30 +1,29 @@
-/// LCS 最长子序列  
-namespace LCS  
-{  
-const int MAXLEN_A = 500;  
-const int MAXLEN_B = 500;  
-int dp[MAXLEN_A+5][MAXLEN_B+5];  
-int deal(const char* a,const char* b)  
-{  
-    int lena=strlen(a);  
-    int lenb=strlen(b);  
-    for(int i=0;i<lenb;i++)  
-    {  
-        for(int j=0;j<lena;j++)  
-        {  
-            if(i==0) dp[i][j]=0;  
-            else if(b[i]==a[j])  
-            {  
-                if(j!=0) dp[i][j]=dp[i-1][j-1]+1;  
-                else dp[i][j]=1;  
-            }  
-            else  
-            {  
-                if(j!=0) dp[i][j]=max(dp[i-1][j],dp[i][j-1]);  
-                else dp[i][j]=dp[i-1][j];  
-            }  
-        }  
-    }  
-    return dp[lenb-1][lena-1];  
-}  
-}//End of namespace LCS  
+/// LCS 最长子序列
+namespace LCS
+{
+const int MAXLEN_A = 512;
+const int MAXLEN_B = 512;
+int dp[MAXLEN_A][MAXLEN_B];
+int deal(const char* a,const char* b)
+{
+    int lena=strlen(a);
+    int lenb=strlen(b);
+    for(int i=0;i<=lenb;i++)
+    {
+        for(int j=0;j<=lena;j++)
+        {
+            if(i==0) dp[i][j]=0;
+            else if(j==0) dp[i][j]=0;
+            else if(b[i-1]==a[j-1])
+            {
+                dp[i][j]=dp[i-1][j-1]+1;
+            }
+            else
+            {
+                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
+            }
+        }
+    }
+    return dp[lenb][lena];
+}
+}//End of namespace LCS