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.
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.
If there's no uncommon subsequence, print "-1". Otherwise print the length of the longest uncommon subsequence of a and b.
abcd defgh
5
a a
-1
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.
题目大意:
给你两个字符串,让你找出最长的非公共子序列。
题目分析:
就是比较两个字符串是否相等嘛,如果相等就输出-1,否则输出较长的那个字符串长度,刚开始感觉太简单怕错。。。太年轻,不过我用那个strcmp函数总是输出不了-1,后来只能一个个比,不过还是挺简单的。
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define maxn 100005
char s1[maxn],s2[maxn];
int main(){
while((scanf("%s%s",s1,s2))!=EOF){
int len1=strlen(s1);
int len2=strlen(s2);
int flag=0;
if(len1!=len2)
flag=1;
//printf("%d\n",flag);
for(int i=0;i<len1;i++)
if(s1[i]!=s2[i])
flag=1;
//printf("%d\n",flag);
if(flag==1)
printf("%d\n",max(len1,len2));
else printf("-1\n");
}
return 0;
}