SWUST OJ(1035)

定位顺序表中最大和最小值

#include<iostream>
#include<cstdlib>

using namespace std;

int main(int argc, char const *argv[])
{
    int n, *data;
    cin>>n;
    data = (int*)malloc(n*sizeof(int));
    for (int i = 0; i < n; ++i)
    {
        cin>>data[i];
    }
    int Lmax = 0,Lmin = 0;
    for(int i=1;i<n;i++)
    {
        if(data[i]>data[Lmax])
        {
            Lmax = i;
        }
        if (data[Lmin]>data[i])
        {
            Lmin = i;
        }
    }
    cout<<"Lmax="<<Lmax<<endl;
    cout<<"Lmin="<<Lmin;
    return 0;
}