Thousand seek million find, finally found the mistake

HDU1102 (minimum spanning tree)

The re-stack overflowed 5 times;

1 intFind_set (intx)2 {3     if(F[x] = =x)4         returnx;5     Else6         returnFind_set (f[x]);7 }8 intMain ()9 {Ten     ........... OneRepu (I,1, n+1) AF[i] = i;///originally F[i] =-1, the result is a stack of, this should not be illegal access to memory -     ........... -}

Baidu Star 1002, the beginning is re-illegal access to memory, the reason is that the array is small, and then is the re-stack: The reason is the array into the main function, the global variable is over ...

Thousand seek million find, finally found the mistake