SPOJ 379. Ambiguous Permutations (PERMUT2)

The constraints N<=100000 make this task an easy one. We need to build the sequence and check if every element is equal to the given sequence if it is then the answer is yes otherwise no.

       FULL SOURCE CODE