Codeforces Round #396(Div. 2)A. Mahmoud and Longest Uncommon Subsequence【水题】
来源:互联网 发布:复制目录 linux 编辑:程序博客网 时间:2024/05/16 15: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 — stringb. Both of these strings are non-empty and consist of lowercase letters of English alphabet. The length of each string is not bigger than105 characters.
If there's no uncommon subsequence, print "-1". Otherwise print the length of the longest uncommon subsequence ofa and b.
abcddefgh
5
aa
-1
In the first example: you can choose "defgh" from stringb as it is the longest subsequence of stringb that doesn't appear as a subsequence of stringa.
题目大意:
找两个字符串的最长不公共子串。
思路:
两个字符串的最长布公公子串就应该是其中一个字符串本身,那么判断两个字符串是否相等,如果相等,那么肯定没有公共子串,结果就是-1.否则就是两个字符串中长的那个的长度。
Ac代码:
#include<stdio.h>#include<string.h>#include<iostream>using namespace std;char a[100005];char b[100005];int main(){ while(~scanf("%s%s",a,b)) { if(strcmp(a,b)==0)printf("-1\n"); else printf("%d\n",max(strlen(a),strlen(b))); }}
- Codeforces Round #396(Div. 2)A. Mahmoud and Longest Uncommon Subsequence【水题】
- 【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
- Codeforces766A Mahmoud and Longest Uncommon Subsequence
- Codeforces Round #396 (Div. 2)Mahmoud and a Message
- Codeforces Round #396 (Div. 2)Mahmoud and a Dictionary
- Codeforces Round #396 (Div. 2)C. Mahmoud and a Message
- Codeforces Round #396 (Div. 2) C.Mahmoud and a Message
- Codeforces Round #396 (Div. 2) C.Mahmoud and a Message
- Codeforces Round #396 (Div. 2) C. Mahmoud and a Message
- Codeforces Round #396 (Div. 2)-C. Mahmoud and a Message(dp)
- Codeforces Round #396 (Div. 2)-D. Mahmoud and a Dictionary(关系并查集)
- 分页查询所需要使用到的泛型类
- AngulerJS学习(三) 路由
- 内功心法 -- java.util.ArrayList<E> (1)
- PHP预定义接口之 ArrayAccess
- Android studio更新问题
- Codeforces Round #396(Div. 2)A. Mahmoud and Longest Uncommon Subsequence【水题】
- android LocalBroadcastManager的使用
- jedisLock—redis分布式锁实现
- 数组
- Android RelativeLayout布局
- 状态码告知从服务器端放回的请求结果
- gradle project sync failed.basic functionality will not work properly
- Oracle字符集的查看查询和Oracle字符集的设置修改
- 三亚游客有福了!三亚游客中心采用全息、体感等“高科技”增强用户体验