输入一个a数组长度为n,然后将a数组排序到一个b数组中,b数组的长度为n*(n+1)/2,然后输出从第left到第right的和。
#include<iostream>
using namespace std;
//求从left到right的和
void sums(int left, int right, int* b, int& sum) {
for (; left <=right; left++)
sum += *(b + left);
}
int main()
{
int n, sum = 0; int temp;
cout << "请输入多少个正整数:";
cin >> n;
int* a = new int[n];
cout << "请输入a数组:";
for (int i = 0; i < n; i++)
cin >> *(a+i);
int len = n * (n + 1) / 2;
int* b = new int[len];
//将a排序
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++) {
if (a[i] >= a[j]) {
temp = *(a+i);
*(a + i) = *(a+j);
*(a + j) = temp;
}
}
//将a赋值给b
for (int i = 0; i < n; i++)
*(b + i) = *(a + i);
cout << endl;
cout << "b=";
for (int j = 0; j < len; j++) {
if (b[j]>=0)
cout << b[j] << " ";
}
cout << endl;
int left, right;
cout << "请输入left和right:";
cin >> left >> right;
sums(left - 1, right - 1, b, sum);
cout << "从left到right的和为:" << sum << endl;
delete[] a;
delete[] b;
return 0;
}