usaco5.5-Hidden Passwords

最小表示法，感觉可以做成个模板，第一次RE是因为字符串长度变2倍了而我把数组开小了

Executing...
   Test 1: TEST OK [0.008 secs, 3760 KB]
   Test 2: TEST OK [0.005 secs, 3760 KB]
   Test 3: TEST OK [0.005 secs, 3760 KB]
   Test 4: TEST OK [0.008 secs, 3760 KB]
   Test 5: TEST OK [0.005 secs, 3760 KB]
   Test 6: TEST OK [0.003 secs, 3760 KB]
   Test 7: TEST OK [0.008 secs, 3760 KB]
   Test 8: TEST OK [0.008 secs, 3760 KB]
   Test 9: TEST OK [0.024 secs, 3760 KB]
   Test 10: TEST OK [0.014 secs, 3760 KB]
   Test 11: TEST OK [0.019 secs, 3760 KB]
   Test 12: TEST OK [0.005 secs, 3760 KB]
   Test 13: TEST OK [0.003 secs, 3760 KB]
   Test 14: TEST OK [0.008 secs, 3760 KB]

All tests OK.

 #include <iostream>
 #include <stdio.h>
 #include <string.h>
 using namespace std;

 char getch2()
 {
     char c;
     while(c=getchar(),c=='\n');
     return c;
 }

 char a[];
 char strTmp[];
 int main()
 {
     freopen("hidden.in","r",stdin);
     freopen("hidden.out","w",stdout);
     int n;
     cin>>n;

     for(int i=;i<n;i++)
     {
         a[i]=getch2();
     }

     a[n]='\0';

     strcpy(strTmp,a);
     strcat(a,strTmp);

     int i=,j=;
     while(j<n)
     {
         int k;
         for(k=;k<n;k++)
         {
             if(a[i+k]!=a[j+k])
                 break;
         }
         if(k==n)
             break;
         if(a[i+k]>a[j+k])
             i+=k+;
         if(a[i+k]<a[j+k])
             j+=k+;

         if(i==j)
             j++;
     }

     cout<<i<<endl;
     return ;
 }