【c++】小技巧——在数组边遍历的过程中求出最值和最值的位置

</pre><pre name="code" class="cpp">#include "stdafx.h"
#include <vector>
#include <iostream>

using namespace std;

int _tmain(int argc, _TCHAR* argv[])
{
    double a[] = {1.1,2.2,3.3,4.4,5.5,8.1,6.6,7.7,5.6,4.3};
    double dMin = 1E100;
    double dMax = -1E100;    //这里将最大值最小值分别设为极小数和极大数，只要数组在此区间内久可以
    int nCnt = 0;
    int nMinIndex = -1;
    int nMaxIndex = -1;
    for(int i = 0; i < 10; i++)
    {
        double b = a[i];
        nMinIndex = b > dMin ? nMinIndex : nCnt;
        nMaxIndex = b > dMax ? nCnt : nMaxIndex;
        dMin = b > dMin ? dMin : b;
        dMax = b > dMax ? b : dMax;
        nCnt++;
    }
    cout << dMin <<"-----"<<nMinIndex<< endl << dMax<<"-----"<<nMaxIndex<<endl ;
    system("pause");
	return 0;
}