poj 1458 C++解法

最新推荐文章于 2023-08-27 20:37:32 发布

i_love_ed6

最新推荐文章于 2023-08-27 20:37:32 发布

阅读量873

点赞数

分类专栏： poj 文章标签： c++ input iostream delete c

本文链接：https://blog.csdn.net/i_love_ed6/article/details/7335680

版权

poj 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

考察知识：动态规划

    #include <iostream>
    using namespace std;

    int c[1000][1000];

    int lcs(char* x, char* y, int m, int n) {
        int i,j;
        for (i = 0; i < m; i++) 
            c[i][0] = 0;
        for (i = 0; i < n; i++)
            c[0][i] = 0;
        for (i = 0; i < m; i++)
            for (j = 0; j < n; j++) {
                if (x[i] == y[j] ) {
    				if (i >= 1 && j >= 1)					
                     c[i][j] = c[i - 1][j - 1] + 1;
    				else 
    					c[i][j] = 1;
                } else if (c[i - 1][j] >= c[i][j - 1]) {
    				if (i >= 1)
                     c[i][j] = c[i - 1][j];
    				else 
    					c[i][j] = 0;
                } else {
    				if (j >= 1)
                     c[i][j] = c[i][j - 1];
    				else
    					c[i][j] = 0;
                }
    			//cout << "i" << i << "j" << j << "value" << c[i][j] << endl;
            }
    	//cout << x << y <<"m"<< m <<"n"<< n <<endl;
    	return c[m - 1][n - 1];
            
    }

    int main(int argc, char *argv[])
    {
    	char* input1 = new char[1000];
    	char* input2 = new char[1000];
    	while (cin >> input1 >> input2) {
    		cout << lcs(input1, input2, strlen(input1), strlen(input2)) << endl;
    	}
    	delete input1;
    	delete input2;
        return 0;
    }