1035: 定位顺序表中的最大和最小值

题目

#include<iostream>
using namespace std;
#define MaxSize 50
#define ElemType int
typedef struct
{
	ElemType data[MaxSize];
	int length;
}SqList;
void InputList(SqList& L)
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> L.data[i];
	}
	L.length = n;
}
void OutputList(SqList L)
{
	for (int i = 0; i < L.length; i++)
	{
		cout << L.data[i] << " ";
	}
}
void Find(SqList L, int& Lmax, int& Lmin)
{
	int max = L.data[0];
	int min = L.data[0];
	for (int i = 0; i < L.length; i++)
	{
		if (L.data[i] >= max)
		{
			max = L.data[i];
			Lmax = i;
		}
		if(L.data[i]<min)
		{
			min = L.data[i];
			Lmin = i;
		}
	}
}
int main()
{
	SqList A;
	InputList(A);
	int Lmax = 0, Lmin = 0;
	Find(A,Lmax,Lmin);
	cout << "Lmax=" << Lmax << endl;
	cout << "Lmin=" << Lmin;
}