POJ 3080 (字符串水题) Blue Jeans

#include <cstdio>
#include <cstring>

char a[15][70], sub[70];
int p[70], l;

int cmp(int p1, int p2)
{
for(int i = 0; i < l; ++i)
if(a[0][p1 + l] > a[0][p2 + l]) return p2;
return p1;
}

int main(void)
{
//freopen("3080in.txt", "r", stdin);
int T;
scanf("%d", &T);
while(T--)
{
int n, cnt = 0;
scanf("%d", &n);
for(int i = 0; i < n; ++i) scanf("%s", a[i]);

for(l = 60; l >= 3; --l)
{
cnt = 0;
for(int pos = 0; pos <= 60 - l; ++pos)
{
char temp = a[0][pos + l];
a[0][pos + l] = '\0';
bool flag = true;
for(int i = 1; i < n; ++i)
{
if(strstr(a[i], a[0] + pos) == NULL)
{
flag = false;
break;
}
if(!flag) break;
}
a[0][pos + l] = temp;
if(flag)
p[cnt++] = pos;
}
if(cnt > 0) break;
}

if(cnt == 0)
{
puts("no significant commonalities");
continue;
}

int min = p[0];
for(int i = 1; i < cnt; ++i) min = cmp(min, p[i]);
a[0][min + l] = '\0';
printf("%s\n", a[0] + min);
}

return 0;
}