POJ 3080.Blue Jeans

题目:http://poj.org/problem?id=3080

AC代码(C++):

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <math.h>
#include <string>
#include <string.h>
#include <bitset>

#define INF 0xfffffff
#define MAXN 2005

using namespace std;

int main(){
	int n;
	cin>>n;
	char seq[15][65];
	for(int nn = 0; nn < n; nn++){
		int m;
		int maxlen = 0;
		char subseq[65];
		char maxsubseq[65];
		cin>>m;
		for(int mm = 0; mm < m; mm++)cin>>seq[mm];
		for(int i = 0; i < 60; i++){
			for(int j = i+1; j <= 60; j++){
				if(i == 0&&j == 8){
					i++;
					i--;
				}
				int kk = i;
				for(; kk < j; kk++){
					subseq[kk-i] = seq[0][kk];
				}
				subseq[kk-i] = '\0';
				int len = kk-i;
				
				bool flag3 = true;
				for(int jj = 1; jj < m; jj++){
					bool flag2 = false;
					for(int k = 0; k < 60; k++){
						bool flag = true;
						for(int l = k; l < k+len; l++){
							if(l>=60){
								flag = false;
								break;
							}
							if(seq[jj][l]!=subseq[l-k]){
								flag = false;
								break;
							}
						}
						if(flag){
							flag2 = true;
							break;
						}
					}
					if(flag2==false){
						flag3 = false;
						break;
					}
				}
				if(flag3){
					if(maxlen<len){
						maxlen = len;
						int jj = 0;
						for(; jj < len; jj++)maxsubseq[jj] = subseq[jj];
						maxsubseq[jj] = '\0';
					}
					else if(maxlen==len){
						bool flag = true;
						for(int k = 0; k < len; k++){
							if(subseq[k]>maxsubseq[k]){
								flag = false;
								break;
							}
							else if(subseq[k]<maxsubseq[k]){
								break;
							}
						}
						if(flag){
							int jj = 0;
							for(; jj < len; jj++)maxsubseq[jj] = subseq[jj];
							maxsubseq[jj] = '\0';
						}
					}
				}
			}
		}
		if(maxlen>=3)cout<<maxsubseq<<endl;
		else cout<<"no significant commonalities\n";
	}
}