【HDOJ】4985 Little Pony and Permutation

水题。

 #include <cstdio>

 #define MAXN 100005

 int buf[MAXN], n;

 int main() {
     int i, j, k;

     while (scanf("%d", &n) != EOF) {
         for (i=; i<=n; ++i)
             scanf("%d", &buf[i]);
         for (i=; i<=n; ++i) {
             if (buf[i]) {
                 printf("(%d", i);
                 j = buf[i];
                 buf[i] = ;
                 while (buf[j]) {
                     printf(" %d", j);
                     k = buf[j];
                     buf[j] = ;
                     j = k;
                 }
                 printf(")");
             }
         }
         printf("\n");
     }

     return ;
 }