dex reverse number

A-frosh WeekTime limit:8000MS Memory Limit:0KB 64bit IO Format:%lld %llu SubmitStatusPracticeUVA 11858Appoint Description:Acmparand (2013-07-07)System Crawler (2014-11-19)DescriptionProblem E:frosh weekduring Frosh Week, students play various fun games to get to know all other and compete against othe R teams. In one such-game, all the Frosh-a team stand in a line, and is then asked to arrange themselves according to some crit Erion, such as their height, their birth date, or their student

Previous questions children queue time limit: 1.0s memory limit: 256.0MBProblem description N A child stands in a row. Now it's time to put them in the order of height from low to high, but only two children are exchanged at each location.Every child has a degree of upset. At the beginning, all the children's unhappy degree is 0.If a child is asked to exchange for the first time, his degree of upset increases by 1, and if he is asked to exchange for the second time, his degree of upset increases

1#include 2#include 3 using namespacestd;4 Long Longans;5 voidMergeint*a,intLeintMidintRT) {6 int*sort_data= (int*) malloc (sizeof(int) * (rt-le+1));7 if(!sort_data)return;8 intI=le,j=mid+1, pt=0;9 while(iRT) {Ten if(a[i]A[j]) { Onesort_data[pt++]=a[i++]; A } - Else{//exist swap action -sort_data[pt++]=a[j++]; the /* - once we swap the postion of both the a[i] and A[j], - We do change the positon of A[i+1......mid] - as a result, we do the pos

Used to do this kind of problem with tree array and line treeThis time change a thought to try, merge sort!#include "SGU" 180. Inversions (merge sort to find the reverse order number)

Demo#include #include#include#include#include#include#defineMAXN 500002#defineINF 0x3f3f3f3fusing namespaceStd;typedefLong Longll;ll tmp[maxn],a[maxn],n;ll CNT=0;voidMergeintLintMintR) { inti=l,j=m+1, k=0; while(iR) { if(A[i]]; Elsetmp[k++]=a[j++],cnt+=m-i+1; } while(i]; while(j]; for(inti=l;il];}voidMergeSort (intLintR) { if(lR) { intMid= (l+r) >>1; MergeSort (L,mid); MergeSort (Mid+1, R); Merge (L,mid,r); }}intMain () { while(cin>>nN) {CNT=0; for(intI=0; i

#include Merge sort to find the number of reverse order