求数组的小和

数组小和的定义：例如，数组s=[1,3,5,2,4,6]，在s[0]的左边小于等于s[0]的数的和为0，在s[1]的左边小于或等于s[1]的数和为1，在s[2]的左边小于等于s[2]的数和为1+3=4..一次类推s[3]—1,s[4]—1+3+2=6,s[5]—15,所以s的小和为0+1+4+1+6+15=27，给定一个数组，实现函数返回小和。

改写mergeSort可以实现o(nlogn)的时间复杂度

注：思路来自于左程云老师的《程序员代码面试指南》

#include <iostream>
using namespace std;
class Solution {
public:
int getSmallSum(int arr[], int length) {
if (arr == NULL || length == 0) {
return 0;
}
return func(arr, 0, length - 1);
}


int func(int s[], int l, int r) {
if (l == r) {
return 0;
}
int mid = (l + r) / 2;
return func(s, l, mid) + func(s, mid + 1, r) + merge(s, l, mid, r);
}


int merge(int s[], int left, int mid, int right) {
int*h = new int[right - left + 1];
int hi = 0;
int i = left;
int j = mid + 1;
int smallSum = 0;
while (i <= mid && j <= right) {
if (s[i] <= s[j]) {
smallSum += s[i] * (right - j + 1);
h[hi++] = s[i++];
}
else {
h[hi++] = s[j++];
}
}
for (; (j < right + 1) || (i < mid + 1); j++, i++) {
h[hi++] = i > mid ? s[j] : s[i];
}
for (int k = 0; k<(right-left+1); k++) {
s[left++] = h[k];
}
return smallSum;
}


void swap(int arr[], int index1, int index2) {
int tmp = arr[index1];
arr[index1] = arr[index2];
arr[index2] = tmp;
}
};
int main() {
int arr[] = {1,3,5,2,4,6 };
Solution so;
cout<<(so.getSmallSum(arr,6));
return 0;
}