蓝桥杯_数列特征

注意数组自定义过大会导致超时难受

#include<iostream>
using namespace std;

 
//int a[1000];
int main(){
 	int n, min , max ;
 	cin >> n;
 	int a[n];
 	for(int i = 0; i < n; ++i)
 	{
 		cin >> a[i];
 	}
 	int sum = 0;
 	min = a[0];
 	max = min;
 	for(int i = 0; i < n; ++i)
 	{
 		sum += a[i];
 		if(a[i] > max) max = a[i];
 		if(a[i] < min) min = a[i];
 	}
 	cout << max << endl;
	 cout << min << endl; 
	 cout << sum <<endl;
    return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_41282102/article/details/88199271