uva10192 longest common sub-sequence

Source: Internet
Author: User

Main topic:
You want to travel, mom and dad gave you advice, you want to keep them sad, you have to meet their advice as much as possible.

Idea: the longest common subsequence
There can be spaces in the string


#include <iostream>
using namespace std;
#include <cstring>
#include <stdio.h>

string s1,s2;
int d[105][105];
int main () {
    int T = 1;
    while (Getline (CIN,S1)) {
        if (s1[0] = = ' # ') break
        Getline (CIN,S2);
        Memset (d,0,sizeof (d));
        int len1 = S1.length ();
        int len2 = S2.length ();
        for (int i = 1, i <= len1; i++) {for
            (int j = 1; J <= Len2; j + +) {
                if (s1[i-1] = = S2[j-1]) {
                        d[i][j ] = d[i-1][j-1] + 1;  
                else {
                        D[i][j] = max (d[i-1][j],d[i][j-1]);
        }}} printf ("Case #%d:you can visit at the most%d cities.\n", T++,d[len1][len2]);
    return 0;

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.