Thanks to HellKitsune for awesome round. har_vi and Your_dad thinking about a variant of Problem and made it public on SPOJ. Hope some of you will try.
Problem Link
Your comments and suggestions are welcome.

Range updates or range set with BIT/fenwick tree

SPOJ/GSS4

1. How should I do range updates with BIT using Union Find Data Structure?what would be expected complexity?
2. In this case max updates can be 7.N*logN but what if we set number in range to random number which don't have such relation with the input.Would it still possible to do it with BIT/fenwick tree or there's any other approach to set elements in range to a given.

Thanks!