zoj 1170

该题的主要思路是，在两个字符串中固定其中一个字符串，移动另外一个字符串进行比较，得到其中相同字符数的最大值

然后在固定两外一个，重复上述步骤

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
         using namespace std; string Str, Ptr; int Match(int i, int length, int j, int count) { int max = 0; while (i < length&&j < count) { if (Str[i] == Ptr[j]) { max++; } i++; j++; } return max; } int gcd(int a, int b) { int g; if (b == 0) g = a; else g = gcd(b, a%b); return g; } int main(int argc, char argv[]) { //ifstream cin("F:\\ac.txt"); char str[100]; while (cin.getline(str, 100)) { if (strcmp(str, "-1") == 0) break; //首先对字符串数组进行处理，分成两个字符串 int i; int length = strlen(str); for (i = 0; i < length; i++) { if (str[i] != ' ') Str += str[i]; else { i = i + 1; break; } } for (; i < length; i++) { Ptr += str[i]; } int count = Str.length(); int number = Ptr.length(); int max = 0; for (int j = 0; j < count; j++) { //第二个字符串位置不动，移动第一个字符串，查找相同字符的个数 int res = Match(j, count, 0, number); if (max < res) max = res; } for (int j = 0; j < count; j++) { //第一个字符串数组位置不懂，移动第二个字符串进行查找 int res = Match(0, count, j, number); if (max < res) max = res; } max = max * 2; int Gcd = gcd(max, count + number); if (max == 0) { cout << "appx(" << Str << "," << Ptr << ") = 0" << endl; } else if (max == count + number) { cout << "appx(" << Str << "," << Ptr << ") = " << (count + number) / Gcd << endl; } else { cout << "appx(" << Str << "," << Ptr << ") = " << max / Gcd << "/" << (count + number) / Gcd << endl; } /*cout << max << endl; cout << Str << "," << Ptr << endl;*/ Str.clear(); Ptr.clear(); } return 0; }