#include<iostream>
using namespace std;
#define N 10000
double a[N];
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
double max_=-10001,min_=10001,sum_=0;
for(int i=0;i<n;i++){
if(max_<=a[i]){
max_=a[i];
}
if(min_>=a[i]){
min_=a[i];
}
sum_+=a[i];
}
cout<<max_<<endl<<min_<<endl<<sum_;
return 0;
}
LQB:数列特征
猜你喜欢
转载自blog.csdn.net/weixin_41297324/article/details/88529651
今日推荐
周排行