zoukankan      html  css  js  c++  java
  • Codeforces Round #396 (Div. 2) A. Mahmoud and Longest Uncommon Subsequence 水题

    A. Mahmoud and Longest Uncommon Subsequence

    题目连接:

    http://codeforces.com/contest/766/problem/A

    Description

    While Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common subsequence. They solved it, and then Ehab challenged Mahmoud with another problem.

    Given two strings a and b, find the length of their longest uncommon subsequence, which is the longest string that is a subsequence of one of them and not a subsequence of the other.

    A subsequence of some string is a sequence of characters that appears in the same order in the string, The appearances don't have to be consecutive, for example, strings "ac", "bc", "abc" and "a" are subsequences of string "abc" while strings "abbc" and "acb" are not. The empty string is a subsequence of any string. Any string is a subsequence of itself.

    Input

    The first line contains string a, and the second line — string b. Both of these strings are non-empty and consist of lowercase letters of English alphabet. The length of each string is not bigger than 105 characters.

    Output

    If there's no uncommon subsequence, print "-1". Otherwise print the length of the longest uncommon subsequence of a and b.

    Sample Input

    abcd
    defgh

    Sample Output

    5

    Hint

    题意

    求两个串的最长不公共子序列

    题解:

    其实答案就两个,要么是-1,要么就是最长的长度,这个思考一下就好了。

    代码

    #include<bits/stdc++.h>
    using namespace std;
    
    string a,b;
    int main()
    {
        cin>>a>>b;
        if(a==b){
            cout<<"-1"<<endl;
        }else
            cout<<max(a.size(),b.size())<<endl;
    }
  • 相关阅读:
    Thinkphp --- 入口文件
    Thinkphp --- 路由定义
    thinkphp --- 写入日志
    BeginnerAdmin后台框架的使用!
    windows本地环境如何用wamp配置多域名绑定访问
    微信小程序 --- 设置页面的标题
    豆瓣api开发
    微信开发 --- 微信支付
    微信小程序 --- 完成小程序支付功能
    thinkphp发起网络请求
  • 原文地址:https://www.cnblogs.com/qscqesze/p/6378289.html
Copyright © 2011-2022 走看看