TOJ---2621--全排列

 1 #include <iostream>
 2 #include <algorithm>
 3 using namespace std;
 4 
 5 int arr[30];
 6 const int inf = 0x3f3f3f3f;
 7 
 8 int main()
 9 {
10     int n , temp;
11     int t;
12     int i , j , k;
13     while( ~scanf("%d",&t) )
14     {
15         while( t-- )
16         {
17             scanf( "%d",&n );
18             for( i = 0 ; i<n ; i++ )
19             {
20                 scanf( "%d",&arr[i] );
21             }
22             sort( arr , arr+n );
23             while(1)
24             {
25                 int mmin = inf;
26                 for( i = 0 ; i<n ; i++ )
27                 {
28                     printf( "%d%c",arr[i],(i==n-1)?‘\n‘:‘ ‘ );
29                 }
30                 for( i = n-1 ; i>=1 ; i-- )
31                 {
32                     if( arr[i]>arr[i-1] )
33                     {
34                         temp = arr[i-1];
35                         k = i-1;
36                         break;
37                     }
38                 }
39                 if( i<=0 )
40                     break;
41                 for( i = n-1 ; i>k ; i-- )
42                 {
43                     if( arr[i]>arr[k] && arr[i]<mmin )
44                     {
45                         mmin = arr[i];
46                         j = i;
47                     }
48                 }
49                 swap( arr[j] , arr[k] );
50                 for( i = k+1 , j = n-1 ; i<j ; i++ , j-- )
51                 {
52                     swap( arr[i] , arr[j] );
53                 }
54             }
55             printf( "\n" );
56         }
57     }
58     return 0;
59 }