uva 10069 Distinct Subsequences （dp + 大数）

最新推荐文章于 2018-09-24 11:23:59 发布

SPZn_up

最新推荐文章于 2018-09-24 11:23:59 发布

阅读量505

点赞数

分类专栏： ====ACM===== DP 文章标签： java dp

本文链接：https://blog.csdn.net/llx523113241/article/details/44811509

版权

====ACM===== 同时被 2 个专栏收录

312 篇文章 0 订阅

订阅专栏

43 篇文章 0 订阅

订阅专栏

uva 10069 Distinct Subsequences

题目大意：给出两个字符串A和B，找出A中所有与B相同的子字符串。

解题思路： $if(A[j - 1]==B[i - 1])$ {

$dp[i][j] = dp[i][j]+dp[i - 1][j - 1];$

}

import java.math.BigInteger;
import java.util.Scanner;

/**
 * Created by spzn on 15-3-30.
 */
public class Main {
    public static void main(String args[]) {
        Scanner cin = new Scanner(System.in);
        BigInteger dp[][] = new BigInteger[105][10005];
        int T, n, m;
        String a, b;
        T = cin.nextInt();
        while (T-- > 0) {
            a = cin.next();
            b = cin.next();
            n = a.length();
            m = b.length();
            for (int i = 0; i <= n; i++) {
               dp[0][i] = BigInteger.ONE;
            }
            for (int i = 1; i <= m; i++) {
                dp[i][0] = BigInteger.ZERO;
                for (int j = 1; j <= n; j++) {
                    dp[i][j] = dp[i][j - 1];
                    if (a.charAt(j - 1) == b.charAt(i - 1)) {
                       dp[i][j] = dp[i][j].add(dp[i - 1][j - 1]);
                    }
                }
            }
            System.out.println(dp[m][n]);
        }
    }
}