话说今天CF同学没事侃闲话的时候跟我提到ACM里一题，叫我用java谢谢看。真的好多时候不做acm的题目，水平下降特别快，一开始连题目的意思都看不懂。讨论一下思路后，利用吃晚饭的时间稍微写了一个。


HDU 1238：http://acm.hdu.edu.cn/show...

import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.List; import java.util.Scanner; public class Main {     public static Scanner cin;     public static List<String> testcase;     public static int count;     public static List<String> runinput(int n){         testcase = new ArrayList<String>();         for (int l=0;l<n;l++){ String temp = cin.next();             testcase.add(temp);         }         Collections.sort(testcase,new Comparator(){             public int compare(Object o1, Object o2){                 String t1=(String) o1;                 String t2=(String) o2;                 int diff = t1.length()-t2.length();                 if (diff >0) return 1; else if (diff ==0) return 0;                 else return -1;                              }         });         return testcase;              }     public static void proccount(int n){         if (n>count) count=n;     }     public static int runcompare(List<String> tc,int ns){         Object[] t=(Object[]) tc.toArray();         int flag=1;         String tocomparestring = (String) t[0];         char[] tocompare = tocomparestring.toCharArray();         int c = ((String) t[0]).length();         for (int jjj=0 ; jjj<c;jjj++){             for (int kkk=c-jjj; kkk>0; kkk--){                 flag =1;                 String tt = String.copyValueOf(tocompare, jjj, kkk);                 StringBuffer sb = new StringBuffer(tt);                 String ttreverse = sb.reverse().toString();                 for (int lll=ns;lll>1;lll--){                     String temp = (String) t[lll-1];                     if (temp.contains(tt)==false) flag=0;                 }                 if (flag == 1) proccount(kkk);                 if (kkk>1){                     flag=1;                     for (int lllb=ns;lllb>1;lllb--){                         String temp = (String) t[lllb-1];                         if (temp.contains(ttreverse)==false) flag=0;                     }                     if (flag == 1) proccount(kkk);                 }             }         }         return 0;     }     public static void main(String[] args){         cin = new Scanner(System.in);         int c=0;         int i = cin.nextInt();         for (int ii=0; ii<i;ii++){             int j = cin.nextInt();             count =0;             runcompare(runinput(j),j);             System.out.println(count);         }     } }