1 #include 
     
       2 using namespace std; 3 #define SIZE 12 4 int data[SIZE]; 5 int data1[SIZE]; 6 int n; 7 int minstep; 8 void xipai(int m); 9 bool shun();10 void dfs(int step);11 int main()12 {13     freopen("in.txt","r",stdin);14     minstep=6;15     while(scanf("%d",&n)!=EOF)16     {17         for(int i=0;i
      
       >data[i];20             data1[i]=data[i];21         }22         dfs(0);23         cout <
       
        <
        
         0;i--)34     {35         if(i>n/2)36         {37             data2[n/2-j-1+n/2]=data1[n/2-j-1];38             data2[n/2+j-n/2]=data1[n/2+j];39         }40         else41         {42             data2[n/2-j-1+i]=data1[n/2-j-1];43             data2[n/2+j-i]=data1[n/2+j];44         }45         j++;46         if(j>n/2-1)47             break;48     }49     for(int i=0;i
         
          data1[i+1])59                 return false;60         }61     }62     if(data1[0]>data1[1])63     {64         for(int i=0;i