需要包含的头文件:
#include <iterator>
#include <valarray>
用到的函数:
max_element()
min_element()
distance()
valarry.sum()
总体实现:(索引值是通过计算数组的起始地址和最大值或最小值的地址之间距离的来计算的)
#include <iostream> #include <iterator> #include <valarray> using namespace std; int matrik[] = {2,3,1,6,7,3}; int main() { //求数组最大值以及最大值的索引 cout << "Max element: " << *max_element(matrik, matrik + sizeof(matrik)/sizeof(matrik[0])) << "\n"; cout << "Max element location: " << distance(matrik, max_element(matrik, matrik + sizeof(matrik)/sizeof(matrik[0]))) << "\n"; //求数组最小值以及最小值的索引 cout << "Min element: " << *min_element(matrik, matrik + sizeof(matrik)/sizeof(matrik[0])) << "\n"; cout << "Min element location: " << distance(matrik, min_element(matrik, matrik + sizeof(matrik)/sizeof(matrik[0]))) << "\n"; //求数组的和 valarray<int> myvalarray_w (matrik,sizeof(matrik)/sizeof(matrik[0])); cout<<myvalarray_w.sum(); return 0; }