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

    题目链接:http://codeforces.com/contest/766/problem/A

    A. Mahmoud and Longest Uncommon Subsequence

    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.

    Examples
    Input
    abcd
    defgh
    Output
    5
    Input
    a
    a
    Output
    -1
    Note

    In the first example: you can choose "defgh" from string b as it is the longest subsequence of string b that doesn't appear as a subsequence of string a.

    #include <iostream>
    #include <cstdio>
    #include <string>
    #include <set>
    #include <map>
    #include <vector>
    #include <algorithm>
    
    using namespace std;
    
    
    int main(){
        ios::sync_with_stdio(false);
        cin.tie(0);
        string a,b;
        cin>>a>>b;
        if(a!=b){
            cout<<max((int)a.size(),(int)b.size())<<endl;
        }
        else{
            cout<<-1<<endl;
        }
        return 0;
    }
  • 相关阅读:
    activiti07- Task
    Activiti-06-.事件
    Activiti-05-.Deployment and MN 2.0 Introduction
    Spring-Hibernate-web的延迟加载方案
    Spring-Struts2-基本集成
    Spring-hibernate-BaseDao
    Spring-hibernate
    Spring-java-模板设计模式
    搭建apache,指定MPM模式为worker(不许用yum安装)
    apache + tomcat负载均衡搭建
  • 原文地址:https://www.cnblogs.com/hymscott/p/6380573.html
Copyright © 2011-2022 走看看