zoukankan      html  css  js  c++  java
  • zoj1170 一道简单的字符串匹配

    It's easy to tell if two words are identical - just check the letters. But how do you tell if two words are almost identical? And how close is "almost"?

    There are lots of techniques for approximate word matching. One is to determine the best substring match, which is the number of common letters when the words are compared letter-byletter.

    The key to this approach is that the words can overlap in any way. For example, consider the words CAPILLARY and MARSUPIAL. One way to compare them is to overlay them:

    CAPILLARY
    MARSUPIAL

    There is only one common letter (A). Better is the following overlay:

    CAPILLARY
         MARSUPIAL

    with two common letters (A and R), but the best is:

       CAPILLARY
    MARSUPIAL

    Which has three common letters (P, I and L).

    The approximation measure appx(word1, word2) for two words is given by:

         common letters * 2
    -----------------------------
    length(word1) + length(word2)

    Thus, for this example, appx(CAPILLARY, MARSUPIAL) = 6 / (9 + 9) = 1/3. Obviously, for any word W appx(W, W) = 1, which is a nice property, while words with no common letters have an appx value of 0.


    Input:

    The input for your program will be a series of words, two per line, until the end-of-file flag of -1.

    Using the above technique, you are to calculate appx() for the pair of words on the line and print the result. For example:

    CAR CART
    TURKEY CHICKEN
    MONEY POVERTY
    ROUGH PESKY
    A A
    -1

    The words will all be uppercase.


    Output:

    Print the value for appx() for each pair as a reduced fraction, like this:

    appx(CAR,CART) = 6/7
    appx(TURKEY,CHICKEN) = 4/13
    appx(MONEY,POVERTY) = 1/3
    appx(ROUGH,PESKY) = 0
    appx(A,A) = 1

    Fractions reducing to zero or one should have no denominator.

    #include <iostream>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    string a,b;
    int l1,l2;
    int fenzi,fenmu;
    int maxsame(int bi,int bj){
        int k = 0;
        for(int i = bi,j = bj; i < l1 && j < l2; i++,j++){
            if(a[i] == b[j])
                k++;
        }
        return k;
    }
    int main() {
        //freopen("in","r",stdin);
        ios::sync_with_stdio(0);
        while(cin >> a && a != "-1"){
    
            cin >> b;
            l1 = a.size();
            l2 = b.size();
            fenzi = 0;
            for(int i = 0; i < l1; i++){
                for(int j = 0; j < l2; j++){
                    if(a[i] == b[j]) {
                        fenzi = max(fenzi, maxsame(i, j));
                    }
                }
            }
            fenmu = l1 + l2;
            fenzi *= 2;
            int g = __gcd(fenzi,fenmu);
            fenzi /= g;
            fenmu /= g;
            cout << "appx(" << a << "," << b << ") = ";
            if(!fenzi) cout << 0 << endl;
            else if(fenzi % fenmu == 0) cout << fenzi/fenmu << endl;
            else
                cout << fenzi << "/" << fenmu << endl;
        }
        return 0;
    }
    View Code
  • 相关阅读:
    ETL开发
    ETL 运行维护
    软件开发的核心
    索引的本质
    也谈谈学习
    oracle内部结构
    [kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher H
    [kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher :G
    [kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher F
    [kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher E
  • 原文地址:https://www.cnblogs.com/xcfxcf/p/12715838.html
Copyright © 2011-2022 走看看