HDU 1238 Substing

【HDU 1238 Substing】的更多相关文章

思路: 1.找出n个字符串中最短的字符串Str[N] 2.从长到短找Str[N]的子子串 subStr[N],以及subStr[N]的反转字符串strrev(subStr[N]):(从长到短是做剪枝处理) 3.用strstr()函数遍历所有的字符串,看是否含有此子子串subStr[N]或strrev(subStr[N]):只要有一个字符串不包含subStr[N]或strrev(subStr[N])就放弃这个子串,尝试下一个: 4.找到第一个满足要求的就输出strlen(subStr[N])或者s…

（KMP 字符串处理）Substrings -- hdu -- 1238

http://acm.hdu.edu.cn/showproblem.php?pid=1238 Substrings Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1238 Description You are given a number of case-sensitive strings of alphabetic characte…

Substrings - HDU 1238（最大共同子串）

题目大意:给你N个串,求出来他们的最大公共子串的长度(子串反过来也算他们的子串). 分析:很久以前就做过这道题,当时是用的strstr做的,不过相同的都是枚举了子串......还是很暴力,希望下次遇到类似的题目我已经掌握高效的方法了. ============================================================================== #include<stdio.h> #include<string.h> ; ; ; c…

hdu 1238 Substrings(kmp+暴力枚举)

Problem Description You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given strings. Input The first line of the input…

HDU 1238

好吧,这题直接搜索就可以了,不过要按照长度最短的来搜,很容易想得到. 记得ACM比赛上有这道题,呃..不过,直接搜..呵呵了,真不敢想. #include <iostream> #include <cstdio> #include <string.h> #include <algorithm> using namespace std; ][]; ],s2[]; int main(){ int T; scanf("%d",&T);…

hdu 2328 Corporate Identity(kmp)

Problem Description Beside other services, ACM helps companies to clearly state their “corporate identity”, which includes company logo but also other signs, like trademarks. One of such companies is Internet Building Masters (IBM), which has recentl…