【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=1; i<=n; ++i)
            scanf("%d", &buf[i]);
        for (i=1; i<=n; ++i) {
            if (buf[i]) {
                printf("(%d", i);
                j = buf[i];
                buf[i] = 0;
                while (buf[j]) {
                    printf(" %d", j);
                    k = buf[j];
                    buf[j] = 0;
                    j = k;
                }
                printf(")");
            }
        }
        printf("\n");
    }

    return 0;
}