求数组中最大值

注意：

1. 要把数组中每个数据都遍历一遍
2. 若存在负数时，初值应该选用什么**（bug）**
3. 若要顺便确定合法性时，初值选用什么

#include<iostream>

using namespace std;

int square[55];
const int minint = -100000000;
bool insquare[55];
int main() 
{
	int i = 0, j = 0,k = 0;
	int n;
	cin >> n;
	for ( i = 1; i <=n ; i++)
	{
		cin >> square[i];
	}
	int maxsquare = minint;
	for ( i = 0; i < n; i++)
	{
		if (maxsquare<square[i]) //比较大小
		{
			if (insquare[i]) // 判断合法性
			{
				maxsquare = square[i];
			}
		}
	}
	cout << maxsquare << endl;
	return 0;
}