【codeforces 766A】Mahmoud and Longest Uncommon Subsequence
来源:互联网 发布:nodejs 搭配nginx 编辑:程序博客网 时间:2024/05/16 19:08
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.
abcddefgh
5
aa
-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.
给你两个串A和B,问你两个串的最长不公共子序列;
#include<cstring>#include<algorithm>#include<cstdio>#include<vector>#define pb push_backusing namespace std;const int N = 301010;int n;char s[N],ss[N];int main(){scanf("%s%s",&s,&ss);int l1=strlen(s);int l2=strlen(ss);if (l1==l2){for (int i=0;i<l1;i++)if (s[i]!=ss[i]){printf("%d\n",l1);return 0;}printf("-1");}else{printf("%d\n",max(l1,l2));}}
- 【codeforces 766A】Mahmoud and Longest Uncommon Subsequence
- 【codeforces 766A】Mahmoud and Longest Uncommon Subsequence
- Codeforces 766A Mahmoud and Longest Uncommon Subsequence
- codeforces 766 A Mahmoud and Longest Uncommon Subsequence
- Codeforces 766A-Mahmoud and Longest Uncommon Subsequence
- codeforces 766A Mahmoud and Longest Uncommon Subsequence
- 766A Mahmoud and Longest Uncommon Subsequence
- A. Mahmoud and Longest Uncommon Subsequence
- Codeforces Round #396(Div. 2)A. Mahmoud and Longest Uncommon Subsequence【水题】
- Codeforces766A Mahmoud and Longest Uncommon Subsequence
- 【codeforces 766B】Mahmoud and a Triangle
- 【codeforces 766C】Mahmoud and a Message
- 【codeforces 766D】Mahmoud and a Dictionary
- codeforces 766C Mahmoud and a Message
- codeforces 766D Mahmoud and a Dictionary
- codeforces 766B Mahmoud and a Triangle
- 【codeforces 766C】Mahmoud and a Message
- CodeForces - 766B Mahmoud and a Triangle
- 【maven】---pom.xml-dependencies
- Services 01
- Javascript面向对象编程(三):非构造函数的继承
- No JDK found. Please validate either IDEA_JDK, JDK_HOME or JAVA_HOME environment variable……问题的解决
- java中Jackson库的ObjectMapper类
- 【codeforces 766A】Mahmoud and Longest Uncommon Subsequence
- Ubuntu下局域网拷贝文件
- c# json
- Android Services之启动
- QQ18年,解密8亿月活的QQ后台服务接口隔离技术
- 启动安卓中的定时功能
- HDU4010 Query on The Trees LCT
- 3.不常关注的java点
- spring源码初步探索