[algogeeks] Re: Finding total number of inversions in an array in O(nlogn) complexity .

2011-06-15 Thread KK
Thanks Harshal!! Actually changing juzz count from int to long long suffices -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to a

Re: [algogeeks] Re: Finding total number of inversions in an array in O(nlogn) complexity .

2011-06-15 Thread Harshal
AC: #include #include #include #include using namespace std; void MergeSort(vector& v, long p, long r); void Merge(vector &v, long p, long q, long r); void PrintArray(vector v); long long int count; int main() { extern long long int count; long n, i, t; vector v; //freopen("input.t

[algogeeks] Re: Finding total number of inversions in an array in O(nlogn) complexity .

2011-06-14 Thread KK
This code is not getting AC on spoj.. m not able to point out the error plzzz help. Here is the link to this problem at spoj : http://www.spoj.pl/problems/INVCNT/ #include #include #include #include using namespace std; void MergeSort(vector &v, int p, int r); void Merge(vector &v, int p, in